All binary codes with covering radius one are subnormal
From MaRDI portal
Publication:1182971
DOI10.1016/0012-365X(91)90028-ZzbMath0744.94007MaRDI QIDQ1182971
Publication date: 28 June 1992
Published in: Discrete Mathematics (Search for Journal in Brave)
94B05: Linear codes (general theory)
Related Items
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