Classification of binary covering codes

DOI<391::AID-JCD1>3.0.CO;2-R 10.1002/1520-6610(2000)8:6<391::AID-JCD1>3.0.CO;2-RzbMath0989.94037OpenAlexW1977807973MaRDI QIDQ4527886

William D. Weakley, Patric R. J. Östergård

Publication date: 19 November 2001

Full work available at URL: https://doi.org/10.1002/1520-6610(2000)8:6<391::aid-jcd1>3.0.co;2-r

zbMATH Keywords

binary covering codeoptimal binary covering codes

Mathematics Subject Classification ID

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

Related Items (4)

Switching of covering codes ⋮ Covering and radius-covering arrays: constructions and classification ⋮ New results on codes with covering radius 1 and minimum distance \(2\) ⋮ On the minimum size of binary codes with length \(2R+4\) and covering radius \(R\)

This page was built for publication: Classification of binary covering codes