Several new lower bounds on the size of codes with covering radius one

DOI10.1109/18.705582zbMath0932.94038OpenAlexW2134722376MaRDI QIDQ4701178

Uri Blass, Simon N. Litsyn

Publication date: 21 November 1999

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

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

zbMATH Keywords

covering radiuscovering codes

Mathematics Subject Classification ID

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

Related Items (3)

Improved lower bounds on the domination number of hypercubes and binary codes with covering radius one ⋮ On the minimum size of 4-uniform hypergraphs without property \(B\) ⋮ An updated table of binary/ternary mixed covering codes

This page was built for publication: Several new lower bounds on the size of codes with covering radius one