Disproof of a conjecture on the existence of balanced optimal covering codes

DOI10.1109/TIT.2002.807307zbMath1063.94127OpenAlexW2116255194WikidataQ123197649 ScholiaQ123197649MaRDI QIDQ4679925

Patric R. J. Östergård

Publication date: 31 May 2005

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

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

Mathematics Subject Classification ID

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

Related Items (2)

Non-uniform covering array with symmetric forbidden edge constraints ⋮ On optimal binary codes with unbalanced coordinates

This page was built for publication: Disproof of a conjecture on the existence of balanced optimal covering codes