The following pages link to Nearly perfect binary codes (Q2556306):
Displaying 15 items.
- Planar functions over fields of characteristic two (Q478357) (← links)
- On non-antipodal binary completely regular codes (Q932675) (← links)
- Algebraic theory of block codes detecting independent errors (Q1132060) (← links)
- New uniqueness proofs for the (5,8,24), (5,6,12) and related Steiner systems (Q1167931) (← links)
- More on the uniqueness of the Golay codes (Q1199629) (← links)
- Weight enumerators of self-orthogonal codes (Q1211033) (← links)
- Nearly perfect codes in distance-regular graphs (Q1231470) (← links)
- Lloyd's theorem for perfect codes (Q1243264) (← links)
- Projective planes of order \(q\) whose collineation groups have order \(q^ 2\) (Q1337043) (← links)
- A simple proof of the formal duality of the Kerdock and Preparata codes (Q1428933) (← links)
- A sharpening of the Johnson bound for binary linear codes and the nonexistence of linear codes with Preparata parameters (Q1802186) (← links)
- An infinite class of counterexamples to a conjecture concerning nonlinear resilient functions (Q1895965) (← links)
- A survey of constructive coding theory, and a table of binary codes of highest known rate (Q2555036) (← links)
- Alphabet-almost-simple 2-neighbour-transitive codes (Q4577872) (← links)
- On the classification and enumeration of self-dual codes (Q5905728) (← links)
