On the normality of multiple covering codes
From MaRDI portal
Publication:1322275
DOI10.1016/0012-365X(94)90164-3zbMath0799.94012OpenAlexW1990887902MaRDI QIDQ1322275
Publication date: 22 November 1994
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(94)90164-3
Related Items
Further results on multiple coverings of the farthest-off points ⋮ Multiple coverings of the farthest-off points with small density from projective geometry
Cites Work
- Unnamed Item
- A new approach to the covering radius of codes
- All binary codes with covering radius one are subnormal
- On \((p,1)\)-subnormal \(q\)-ary covering codes
- More binary covering codes are normal
- Upper bounds for q-ary covering codes
- A note on perfect multiple coverings of the Hamming space
- On (k, t)-subnormal covering codes
- Some results on the norm of codes
- 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 I. Bounds on Normalized Covering Radius
- On the Covering Radius Problem for Codes II. Codes of Low Dimension; Normal and Abnormal Codes
- Lower bounds for binary covering codes
- Further results on (k, t)-subnormal covering codes
- Bounds for abnormal binary codes with covering radius one
- Binary linear quasi-perfect codes are normal
- Modified bounds for covering codes
- The hardness of solving subset sum with preprocessing
