On the Covering Radius Problem for Codes II. Codes of Low Dimension; Normal and Abnormal Codes
From MaRDI portal
Publication:3786403
DOI10.1137/0608050zbMath0643.94021OpenAlexW1985106002MaRDI QIDQ3786403
N. J. A. Sloane, Karen E. Kilby
Publication date: 1987
Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0608050
Theory of error-correcting codes and error-detecting codes (94B99) Combinatorial aspects of packing and covering (05B40)
Related Items
The solution to Berlekamp's switching game, All binary codes with covering radius one are subnormal, Bounds for binary multiple covering codes, On the normality of multiple covering codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new approach to the covering radius of codes
- On the covering radius of codes
- Covering radius---Survey and recent results
- Further results on the covering radius of codes
- Computing automorphism groups of error-correcting codes
- Minimum-distance bounds for binary linear codes