Bounds for abnormal binary codes with covering radius one

DOI10.1109/18.75256MaRDI QIDQ5753879zbMATH OpenOpenAlexFDO

Authors Iiro 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

zbMATH Keywords

binary codecovering codecovering radiuslower boundsminimum cardinalitynormal and abnormal codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Recommendations

• Normal and abnormal codes
• More binary covering codes are normal
• On the Covering Radius Problem for Codes II. Codes of Low Dimension; Normal and Abnormal Codes
• scientific article; zbMATH DE number 1456810
• Further results on the covering radius of codes

Cited in

(9)

• 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
• More binary covering codes are normal
• On the Covering Radius Problem for Codes II. Codes of Low Dimension; Normal and Abnormal Codes
• All binary linear codes of lengths up to 18 or redundancy up to 10 are normal
• Density of constant radius normal binary covering codes

This page was built for publication: Bounds for abnormal binary codes with covering radius one

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5753879)