Lower bounds on covering codes via partition matrices

DOI10.1016/J.JCTA.2008.06.008zbMath1160.94020OpenAlexW2023908631MaRDI QIDQ1003655

Wolfgang Haas, Jan-Christoph Schlage-Puchta, Jörn Quistorff

Publication date: 4 March 2009

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2008.06.008

zbMATH Keywords

covering codespartition matricesRodemich boundsurjective codes

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)

The covering problem in Rosenbloom-Tsfasman spaces ⋮ Invariant sets under linear operator and covering codes over modules ⋮ Bounds for short covering codes and reactive tabu search ⋮ Hypercube Packings and Coverings with Higher Dimensional Rooks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Further results on the covering radius of small codes
• Families of \(k\)-independent sets
• Bounds for covering codes over large alphabets
• On the covering radius of small codes
• A note on bounds for q-ary covering codes
• Coverings by rook domains

This page was built for publication: Lower bounds on covering codes via partition matrices