Subcodes and covering radius (Corresp.)

DOI10.1109/TIT.1986.1057229MaRDI QIDQ3757823zbMATHFDO

Authors

Publication date 1986

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

zbMATH Keywords

binary codelinear codes over GF(2)lower bound on the covering radiusupper bound on the norm of a code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• On the covering radius of subcodes of a code
• On the covering radius of a code and its subcodes
• On the covering radius of codes
• scientific article; zbMATH DE number 4016768
• On the covering radius of binary codes (Corresp.)
• Further results on the covering radius of codes
• scientific article; zbMATH DE number 1522570
• On the covering radius of Simplex codes
• scientific article; zbMATH DE number 4160649
• The multicovering radii of codes

Cited in

(8)

• Bounds on the dimension of codes and subcodes with prescribed contraction index
• scientific article; zbMATH DE number 4016768 (Why is no real title available?)
• On the covering radius of a code and its subcodes
• scientific article; zbMATH DE number 3952657 (Why is no real title available?)
• Covering radius and the chromatic number of Kneser graphs
• A note on the covering radius of optimum codes
• scientific article; zbMATH DE number 3965968 (Why is no real title available?)
• The solution to Berlekamp's switching game

This page was built for publication: Subcodes and covering radius (Corresp.)

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