Pages that link to "Item:Q5937131"
From MaRDI portal
The following pages link to Binary \(B_2\)-sequences: a new upper bound (Q5937131):
Displaying 9 items.
- Signature codes for noisy multiple access adder channel (Q510479) (← links)
- An application of coding theory to estimating Davenport constants (Q634137) (← links)
- An upper bound for \(B_2 [2]\) sequences (Q1971018) (← links)
- Separable collusion-secure multimedia codes (Q2044131) (← links)
- A note on \(\overline{2} \)-separable codes and \(B_2\) codes (Q2065925) (← links)
- Improved upper bounds for parent-identifying set systems and separable codes (Q2220762) (← links)
- On the number of divisors which are values of a polynomial (Q2269011) (← links)
- Proof of a conjecture of Sarwate and Pursley regarding pairs of binary m-sequences (Q4857520) (← links)
- Nonoverlapping convex polytopes with vertices in a Boolean cube and other problems in coding theory (Q6173473) (← links)