On lower bounds for covering codes

DOI10.1023/A:1008364924033MaRDI QIDQ1281409zbMATH OpenOpenAlexFDO

Authors M. C. Bhandari, K. K. P. Chanduka, Arbind Kumar Lal

Publication date 18 September 2001

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1008364924033

zbMATH Keywords

binary codebinary covering codecovering radiusHamming spaceHamming sphereslower boundsminimum number of codewordssphere bound

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 lower bounds for covering codes
• New lower bounds for covering codes
• Improved sphere bounds on the covering radius of codes
• New lower bounds for binary covering codes

Cited in

(17)

• Lower bounds on covering codes via partition matrices
• A lower bound for 0,1,* tournament codes
• Bounds for binary multiple covering codes
• Exact bounds on the sizes of covering codes
• Bounds on the sizes of constant weight covering codes
• Some new lower bounds for ternary covering codes
• Sum-free sets and short covering codes
• Linear inequalities for covering codes. I. Pair covering inequalities
• Lower bounds for q-ary covering codes
• Some new lower bounds for binary and ternary covering codes
• Almost cover-free codes and designs
• Modified bounds for covering codes
• New lower bounds for covering codes
• New lower bounds for covering codes
• Covering codes for the fixed length Levenshtein metric
• Exact minimum codegree thresholds for \(K_4^-\)-covering and \(K_5^-\)-covering
• Bounds for short covering codes and reactive tabu search

This page was built for publication: On lower bounds for covering codes

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