Lower bounds for binary covering codes

DOI10.1109/18.2644zbMath0652.94015OpenAlexW2157335387MaRDI QIDQ3798594

Iiro S. 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)

Related Items (10)

On \((p,1)\)-subnormal \(q\)-ary covering codes ⋮ Long binary narrow-sense BCH codes are normal ⋮ The solution to Berlekamp's switching game ⋮ New upper bounds for binary covering codes ⋮ 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 ⋮ Upper bounds for football pool problems and mixed covering codes ⋮ Construction of new codes and its related parameters ⋮ On the normality of multiple covering codes

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