A new approach to the covering radius of codes

DOI10.1016/0097-3165(86)90007-5zbMath0608.94003OpenAlexW1977189634MaRDI QIDQ1086543

N. J. A. Sloane

Publication date: 1986

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(86)90007-5

zbMATH Keywords

covering radiusbinary linear codecode dimensionBerlekamp-Gale switching game

Mathematics Subject Classification ID

Integer programming (90C10) Linear codes (general theory) (94B05) Source coding (94A29)

Related Items (7)

New upper bounds for the football pool problem for 11 and 12 matches ⋮ The solution to Berlekamp's switching game ⋮ On the Covering Radius Problem for Codes I. Bounds on Normalized Covering Radius ⋮ On the Covering Radius Problem for Codes II. Codes of Low Dimension; Normal and Abnormal Codes ⋮ Bounds for binary multiple covering codes ⋮ Simplifications to ``A new approach to the covering radius ⋮ On the normality of multiple covering codes

Cites Work

• Unnamed Item
• Unnamed Item
• Balancing matrices with line shifts
• On the enumeration of self-dual codes
• Self-dual codes over GF(5)
• On extensions of the Gale-Berlekamp switching problem and constants of \(\ell_p\)-spaces
• On the covering radius of codes
• Covering radius---Survey and recent results
• The covering radius of the Leech lattice
• Self-dual codes over<tex>GF(3)</tex>and<tex>GF(4)</tex>of length not exceeding 16
• A Catalogue of Combinatorial Geometries
• Minimization of ±1 matrices under line shifts

This page was built for publication: A new approach to the covering radius of codes