New lower bounds for covering codes

DOI10.1016/S0012-365X(00)00011-XzbMath0987.94047MaRDI QIDQ5915413

Alain Plagne, Laurent Habsieger

Publication date: 29 January 2001

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

lower boundscovering code

Mathematics Subject Classification ID

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

Related Items (3)

Improved lower bounds on the domination number of hypercubes and binary codes with covering radius one ⋮ On the minimum size of binary codes with length \(2R+4\) and covering radius \(R\) ⋮ An updated table of binary/ternary mixed covering codes

This page was built for publication: New lower bounds for covering codes