More binary covering codes are normal

DOI10.1109/18.59947MaRDI QIDQ3199339zbMATH OpenOpenAlexFDO

Authors G. J. M. van Wee

Publication date 1990

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.59947

zbMATH Keywords

covering radiusminimal distanceabnormal codesoptimal binary code

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Recommendations

• Normal and abnormal codes
• Bounds for abnormal binary codes with covering radius one
• 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
• Long binary narrow-sense BCH codes are normal

Cited in

(9)

• On normal and subnormal q-ary codes
• Bounds for abnormal binary codes with covering radius one
• A rational periodicity theorem for division codes
• All binary codes with covering radius one are subnormal
• Bounds for binary multiple covering codes
• On the normality of multiple covering codes
• Long binary narrow-sense BCH codes are normal
• 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: More binary covering codes are normal

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