Asymptotic bounds on the covering radius of binary codes

DOI10.1109/18.59948MaRDI QIDQ3199338zbMATH OpenOpenAlexFDO

Authors Patrick Solé

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.59948

zbMATH Keywords

weight distributionBCH codescovering radiusReed-Muller codesbinary codesasymptotic boundsquadratic residue codesasymptotically perfect codes

Mathematics Subject Classification ID

Combinatorial codes (94B25) Bounds on codes (94B65) Realizations from input-output data (93B15)

Recommendations

• scientific article; zbMATH DE number 1284421
• Some new upper bounds on the covering radius of binary linear codes
• On the covering radius of binary codes (Corresp.)
• Asymmetric binary covering codes.
• Covering radius 1985-1994

Cited in

(20)

• Generalization of the Norse bounds to codes of higher strength
• Asymptotic minimum covering radius of block codes
• scientific article; zbMATH DE number 1522570 (Why is no real title available?)
• An asymptotic bound on the covering radii of binary BCH codes
• scientific article; zbMATH DE number 5543120 (Why is no real title available?)
• Some new upper bounds on the covering radius of binary linear codes
• The covering radius of extreme binary 2-surjective codes
• Asymptotic bound on binary self-orthogonal codes
• Covering codes with improved density
• Optimal binary covering codes of length 2j
• Weight distribution and dual distance
• scientific article; zbMATH DE number 125908 (Why is no real title available?)
• The covering radius of spherical designs
• Do most binary linear codes achieve the Goblick bound on the covering radius? (Corresp.)
• On the covering radius of Reed-Muller codes
• On the asymptotic behaviour of Lee-codes
• On the covering radius of binary codes (Corresp.)
• Covering radius and dual distance
• scientific article; zbMATH DE number 910958 (Why is no real title available?)
• Asymptotical properties of linear codes

This page was built for publication: Asymptotic bounds on the covering radius of binary codes

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