Lower bounds for binary covering codes

DOI10.1109/18.2644MaRDI QIDQ3798594zbMATH OpenOpenAlexFDO

Authors Iiro Honkala

Publication date 1988

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

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

zbMATH Keywords

lower boundsminimum cardinality of a binary code

Mathematics Subject Classification ID

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

Cited in

(20)

• A lower bound for 0,1,* tournament codes
• The solution to Berlekamp's switching game
• Bounds on packings and coverings by spheres in \(q\)-ary and mixed Hamming spaces
• All binary codes with covering radius one are subnormal
• Bounds for binary multiple covering codes
• On the normality of multiple covering codes
• On \((p,1)\)-subnormal \(q\)-ary covering codes
• Long binary narrow-sense BCH codes are normal
• New upper bounds for binary covering codes
• Some new lower bounds for ternary covering codes
• Construction of new codes and its related parameters
• scientific article; zbMATH DE number 4218008 (Why is no real title available?)
• Optimal binary covering codes of length 2j
• Lower bounds for q-ary covering codes
• Bounds for binary codes of length less than 25
• Some new lower bounds for binary and ternary covering codes
• An improvement of the Van Wee bound for binary linear covering codes
• Modified bounds for covering codes
• Upper bounds for football pool problems and mixed covering codes
• Generalized bounds and binary/ternary mixed packing and covering codes

This page was built for publication: Lower bounds for binary covering codes

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