Subcodes and covering radius (Corresp.)

DOI10.1109/TIT.1986.1057229zbMATH Open0619.94011MaRDI QIDQ3757823FDOQ3757823

Authors:

Publication date: 1986

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

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
• 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
• The multicovering radii of codes

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)

Cited In (8)

• Title not available (Why is that?)
• The solution to Berlekamp's switching game
• Bounds on the dimension of codes and subcodes with prescribed contraction index
• A note on the covering radius of optimum codes
• Title not available (Why is that?)
• Covering radius and the chromatic number of Kneser graphs
• On the covering radius of a code and its subcodes
• Title not available (Why is that?)

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)