A new binary code of length 10 and covering radius 1

DOI10.1109/18.61135zbMATH Open0713.94023OpenAlexW2099362564MaRDI QIDQ3199337FDOQ3199337

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)

Cited In (3)

• New upper bounds for binary covering codes
• New upper bounds for the football pool problem for 11 and 12 matches
• 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)