New lower bounds for binary covering codes
From MaRDI portal
Publication:4324172
DOI10.1109/18.335963zbMath0813.94021OpenAlexW3143455865MaRDI QIDQ4324172
Publication date: 1 March 1995
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.335963
Bounds on codes (94B65) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
Related Items
New upper bounds for binary covering codes, Improved lower bounds on the domination number of hypercubes and binary codes with covering radius one, Bounds for binary multiple covering codes