The following pages link to (Q5612989):
Displaying 8 items.
- On tilings of the binary vector space (Q1148323) (← links)
- An improved version of Lloyd's theorem (Q1227561) (← links)
- On perfect codes in the Hamming schemes H(n,q) with q arbitrary (Q1237695) (← links)
- A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry (Q1802134) (← links)
- Perfect codes in the graphs \(O_k\) (Q1844190) (← links)
- A survey of constructive coding theory, and a table of binary codes of highest known rate (Q2555036) (← links)
- Nearly perfect binary codes (Q2556306) (← links)
- Integer zeros of \(q\)-Krawtchouk polynomials in classical combinatorics (Q5956775) (← links)
