Asymptotic bounds on the covering radius of binary codes

DOI10.1109/18.59948zbMath0713.94024OpenAlexW1976729570MaRDI QIDQ3199338

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

BCH codesReed-Muller codescovering radiusbinary codesweight distributionasymptotic boundsquadratic residue codesasymptotically perfect codes

Mathematics Subject Classification ID

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

Related Items (4)

The covering radius of spherical designs ⋮ On the covering radius of Reed-Muller codes ⋮ Covering radius and dual distance ⋮ Weight distribution and dual distance

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