All binary codes with covering radius one are subnormal

DOI10.1016/0012-365X(91)90028-ZzbMath0744.94007MaRDI QIDQ1182971

Iiro S. Honkala

Publication date: 28 June 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

covering radiusbinary codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (2)

Bounds for binary multiple covering codes ⋮ On the normality of multiple covering codes

Cites Work

• More binary covering codes are normal
• On the covering radius of codes
• Covering radius---Survey and recent results
• Further results on the covering radius of codes
• On the Covering Radius Problem for Codes II. Codes of Low Dimension; Normal and Abnormal Codes
• Lower bounds for binary covering codes
• Improved sphere bounds on the covering radius of codes
• Bounds for abnormal binary codes with covering radius one
• Modified bounds for covering codes
• The hardness of solving subset sum with preprocessing

This page was built for publication: All binary codes with covering radius one are subnormal