Lower bounds for q-ary covering codes

DOI10.1109/18.54887MaRDI QIDQ3483225zbMATH OpenOpenAlexFDO

Authors Wende Chen, Iiro Honkala

Publication date 1990

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.54887

zbMATH Keywords

covering radiusminimal cardinalityq-ary codeCombinatorial lower bounds

Mathematics Subject Classification ID

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

Recommendations

• Lower bounds for q-ary codes with large covering radius
• Lower bounds for q-ary codes of covering radius one
• Upper bounds for q-ary covering codes
• A note on bounds for q-ary covering codes
• On lower bounds for covering codes
• Lower bounds for quaternary covering codes
• Lower bounds for binary covering codes
• New lower bounds for covering codes
• New lower bounds for covering codes
• New lower bounds for binary covering codes

Cited in

(16)

• Partial sums of binomials, intersecting numbers, and the excess bound in Rosenbloom-Tsfasman space
• Integer programming for covered codes
• A lower bound for 0,1,* tournament codes
• New lower bounds on \(q\)-ary error-correcting codes
• Lower bounds for \(q\)-ary coverings by spheres of radius one
• Binary codes with covering radius one: Some new lower bounds
• Lower bounds for quaternary covering codes
• Bounds for covering codes over large alphabets
• The covering problem in Rosenbloom-Tsfasman spaces
• Lower bounds on covering codes via partition matrices
• Lower bounds for q-ary codes with large covering radius
• Upper bounds for football pool problems and mixed covering codes
• Bounds on packings and coverings by spheres in \(q\)-ary and mixed Hamming spaces
• Invariant sets under linear operator and covering codes over modules
• New constructions for \(q\)-ary covering codes
• A new lower bound for the football pool problem for 7 matches

This page was built for publication: Lower bounds for q-ary covering codes

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