Nearly perfect binary codes

DOI10.1016/0012-365X(72)90025-8MaRDI QIDQ2556306zbMATH OpenOpenAlexWikidataFDO

Authors Jean-Marie Goethals, Stephen L. Snover

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)

Recommendations

• scientific article; zbMATH DE number 3499624
• Perfect binary codes: constructions, properties, and enumeration
• scientific article; zbMATH DE number 2154154
• scientific article; zbMATH DE number 503208
• On a property of perfect binary codes

Cites work

• A class of optimum nonlinear double-error-correcting codes
• An optimum nonlinear code
• scientific article; zbMATH DE number 3167429 (Why is no real title available?)
• scientific article; zbMATH DE number 3172224 (Why is no real title available?)
• scientific article; zbMATH DE number 3763833 (Why is no real title available?)
• scientific article; zbMATH DE number 3480474 (Why is no real title available?)
• scientific article; zbMATH DE number 3318360 (Why is no real title available?)
• scientific article; zbMATH DE number 3321827 (Why is no real title available?)
• scientific article; zbMATH DE number 3335652 (Why is no real title available?)
• New binary codes
• On tactical configurations and error-correcting codes

Cited in

(19)

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

This page was built for publication: Nearly perfect binary codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2556306)