Nearly perfect binary codes
From MaRDI portal
Publication:2556306
DOI10.1016/0012-365X(72)90025-8zbMath0248.94018MaRDI QIDQ2556306
Jean-Marie Goethals, Stephen L. Snover
Publication date: 1972
Published in: Discrete Mathematics (Search for Journal in Brave)
94B60: Other types of codes
Related Items
On the classification and enumeration of self-dual codes, On non-antipodal binary completely regular codes, 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, A survey of constructive coding theory, and a table of binary codes of highest known rate
Cites Work
