An Upper Bound on Covering Radius

DOI10.1016/S0304-0208(08)73421-2MaRDI QIDQ3337370zbMATH OpenOpenAlexFDO

Authors H. F. jun. Mattson

Publication date 1983

Published in Combinatorial Mathematics, Proceedings of the International Colloquium on Graph Theory and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-0208(08)73421-2

zbMATH Keywords

binary linear codeDelsarte's boundparity-check matrixupper bound on the covering radius

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• Another upper bound on covering radius
• Upper bounds on the covering radius of a code with a given dual distance
• Bounds on the covering radius of linear codes
• Construction of linear covering codes
• An upper bound on the covering radius as a function of the dual distance

Cited in

(17)

• A note on the covering radius of optimum codes
• A covering theorem about radial segments
• Eigenvalues, eigenspaces and distances to subsets
• On upper bounds for minimum distance and covering radius of non-binary codes
• Some upper bounds on the covering radii of linear codes over \({\mathbb{F}}_q\) and their applications
• Covering radius for sets of permutations
• On an algebraic method for bounding the covering radius
• Bounds for optimal coverings
• Multicovering bounds from relative covering radii
• On the covering radius of codes
• Further results on the covering radius of codes
• On the covering radius of subcodes of a code
• A Brief Survey of Covering Radius
• Another upper bound on covering radius
• Covering radius of RM(1,9) in RM(3,9)
• scientific article; zbMATH DE number 1456813 (Why is no real title available?)
• scientific article; zbMATH DE number 4185547 (Why is no real title available?)

This page was built for publication: An Upper Bound on Covering Radius

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