Nearly perfect binary codes

DOI10.1016/0012-365X(72)90025-8zbMath0248.94018OpenAlexW1990828614WikidataQ127332989 ScholiaQ127332989MaRDI QIDQ2556306

Stephen L. Snover, Jean-Marie Goethals

Publication date: 1972

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(72)90025-8

Mathematics Subject Classification ID

Other types of codes (94B60)

Related Items (15)

Projective planes of order \(q\) whose collineation groups have order \(q^ 2\) ⋮ An infinite class of counterexamples to a conjecture concerning nonlinear resilient functions ⋮ Alphabet-almost-simple 2-neighbour-transitive codes ⋮ Algebraic theory of block codes detecting independent errors ⋮ New uniqueness proofs for the (5,8,24), (5,6,12) and related Steiner systems ⋮ A simple proof of the formal duality of the Kerdock and Preparata codes ⋮ Planar functions over fields of characteristic two ⋮ On non-antipodal binary completely regular codes ⋮ More on the uniqueness of the Golay codes ⋮ On the classification and enumeration of self-dual codes ⋮ Weight enumerators of self-orthogonal codes ⋮ Nearly perfect codes in distance-regular graphs ⋮ Lloyd's theorem for perfect codes ⋮ A sharpening of the Johnson bound for binary linear codes and the nonexistence of linear codes with Preparata parameters ⋮ A survey of constructive coding theory, and a table of binary codes of highest known rate

Cites Work

• An optimum nonlinear code
• A class of optimum nonlinear double-error-correcting codes
• On tactical configurations and error-correcting codes
• New binary codes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Nearly perfect binary codes