Further results on the covering radius of small codes

DOI10.1016/j.disc.2006.04.038zbMath1278.94098OpenAlexW2081627583MaRDI QIDQ861794

Patric R. J. Östergård, Gerzson Kéri

Publication date: 2 February 2007

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

Full work available at URL: https://doi.org/10.1016/j.disc.2006.04.038

zbMATH Keywords

covering radiusmixed codecovering codesurjective 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)

Related Items (4)

Unnamed Item ⋮ Covering and radius-covering arrays: constructions and classification ⋮ Lower bounds on covering codes via partition matrices ⋮ On the minimum size of binary codes with length \(2R+4\) and covering radius \(R\)

Cites Work

• Unnamed Item
• Unnamed Item
• Two applications (for search theory and truth functions) of Sperner type theorems
• Families of \(k\)-independent sets
• Upper bounds for q-ary covering codes
• Further results on the covering radius of codes
• Group Partitions and Mixed Perfect Codes
• On the covering radius of small codes
• An updated table of binary/ternary mixed covering codes
• A note on bounds for q-ary covering codes
• Modified bounds for covering codes

This page was built for publication: Further results on the covering radius of small codes