Upper bounds for q-ary covering codes

DOI10.1109/18.79926MaRDI QIDQ3358650zbMATH OpenOpenAlexFDO

Authors Patric R. J. Östergård

Publication date 1991

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

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

zbMATH Keywords

covering radiusnormal codesq-ary covering codes

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)

Recommendations

• New constructions for \(q\)-ary covering codes
• A note on bounds for q-ary covering codes
• Lower bounds for q-ary codes with large covering radius
• Some new lower bounds for binary and ternary covering codes
• Lower bounds for q-ary covering codes

Cited in

(13)

• New upper bounds for binary covering codes
• On normal and subnormal q-ary codes
• Bounds for short covering codes and reactive tabu search
• Further results on the covering radius of small codes
• \(K_{5}(7,3) \leqslant 100\).
• Lower bounds for q-ary covering codes
• New upper bounds for the football pool problem for 11 and 12 matches
• Bounds for binary multiple covering codes
• On the normality of multiple covering codes
• scientific article; zbMATH DE number 6004916 (Why is no real title available?)
• On lengthening of covering codes
• Invariant sets under linear operator and covering codes over modules
• New constructions for \(q\)-ary covering codes

This page was built for publication: Upper 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 Q3358650)