On the size of optimal binary codes of length 9 and covering radius 1

DOI10.1109/18.945268zbMath1002.94052OpenAlexW2102753652MaRDI QIDQ4544695

Patric R. J. Östergård, Uri Blass

Publication date: 4 August 2002

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

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

zbMATH Keywords

linear programmingnonlinear codesoptimal codescode equivalencecovering codeweighted codes

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Related Items (10)

Improved lower bounds on the domination number of hypercubes and binary codes with covering radius one ⋮ Packings in bipartite prisms and hypercubes ⋮ On the minimum size of 4-uniform hypergraphs without property \(B\) ⋮ Switching codes and designs ⋮ (Total) domination in prisms ⋮ New results on codes with covering radius 1 and minimum distance \(2\) ⋮ On solving a hard quadratic 3-dimensional assignment problem ⋮ A remark on Haas' method ⋮ An updated table of binary/ternary mixed covering codes ⋮ A new lower bound for the football pool problem for six matches

Uses Software

• nauty

This page was built for publication: On the size of optimal binary codes of length 9 and covering radius 1