Lower bounds for q-ary codes with large covering radius

zbMATH Open1226.94022MaRDI QIDQ2380299FDOQ2380299

Authors: Wolfgang Haas, Immanuel Halupczok, Jan-Christoph Schlage-Puchta 

Publication date: 26 March 2010

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/228107

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Lower bounds for q-ary covering codes
• Lower bounds on covering codes via partition matrices
• Lower bounds for \(q\)-ary codes of covering radius one
• Some new lower bounds for binary and ternary covering codes
• Bounds for covering codes over large alphabets

zbMATH Keywords

lower boundscovering codespartition matrices

Mathematics Subject Classification ID

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

Cited In (5)

• Lower bounds for quaternary covering codes
• Bounds for covering codes over large alphabets
• New lower bounds for covering codes
• Lower bounds on covering codes via partition matrices
• Lower bounds for q-ary covering codes

This page was built for publication: Lower bounds for \(q\)-ary codes with large covering radius

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380299)