Another upper bound on covering radius

DOI10.1109/TIT.1983.1056680MaRDI QIDQ4742700zbMATH OpenOpenAlexFDO

Authors H. F. jun. Mattson

Publication date 1983

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

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

zbMATH Keywords

binary linear codescode-wordscovering radius

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

• An Upper Bound on Covering Radius
• Some new upper bounds on the covering radius of binary linear codes
• Upper bounds on the covering radius of a code with a given dual distance
• On the covering radius of subcodes of a code
• On the covering radius of binary codes (Corresp.)

Cited in

(8)

• New upper bounds for binary covering codes
• On upper bounds for minimum distance and covering radius of non-binary codes
• Bounds on the covering radius of linear codes
• On an algebraic method for bounding the covering radius
• An Upper Bound on Covering Radius
• On the covering radius of subcodes of a code
• On Generalized Hamming Weights and the Covering Radius of Linear Codes
• scientific article; zbMATH DE number 4185547 (Why is no real title available?)

This page was built for publication: Another upper bound on covering radius

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