A new binary code of length 10 and covering radius 1

DOI10.1109/18.61135MaRDI QIDQ3199337zbMATH OpenOpenAlexFDO

Authors Patric R. J. Östergård

Publication date 1991

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.61135

zbMATH Keywords

simulated annealingcovering radiusbinary codesmixed code

Mathematics Subject Classification ID

Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Recommendations

• scientific article; zbMATH DE number 621972
• On the size of optimal binary codes of length 9 and covering radius 1
• scientific article; zbMATH DE number 1456811
• scientific article; zbMATH DE number 1456810
• On the minimum size of binary codes with length \(2R+4\) and covering radius \(R\)

Cited in

(3)

• New upper bounds for the football pool problem for 11 and 12 matches
• New upper bounds for binary covering codes
• An updated table of binary/ternary mixed covering codes

This page was built for publication: A new binary code of length 10 and covering radius 1

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