Lower Bounds for Binary Codes of Covering Radius One
From MaRDI portal
Publication:3548961
DOI10.1109/TIT.2007.901186zbMath1325.94164MaRDI QIDQ3548961
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Other types of codes (94B60) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
Related Items (2)
Improved lower bounds on the domination number of hypercubes and binary codes with covering radius one ⋮ Partial sums of binomials, intersecting numbers, and the excess bound in Rosenbloom-Tsfasman space
This page was built for publication: Lower Bounds for Binary Codes of Covering Radius One