Bounds for abnormal binary codes with covering radius one
From MaRDI portal
Publication:5753879
DOI10.1109/18.75256zbMath0721.94013OpenAlexW2161595612MaRDI QIDQ5753879
Iiro S. Honkala, Heikki O. Hämäläinen
Publication date: 1991
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.75256
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
All binary codes with covering radius one are subnormal ⋮ Covering bounds for codes ⋮ Covering machines ⋮ Bounds for binary multiple covering codes ⋮ On the normality of multiple covering codes