Some inequalities about the covering radius of Reed-Muller codes

DOI10.1007/BF00141965zbMath0756.94009OpenAlexW1985815096MaRDI QIDQ1200290

Xiang-Dong Hou

Publication date: 16 January 1993

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00141965

zbMATH Keywords

covering radiusReed-Muller code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (1)

Further results on the covering radii of the Reed-Muller codes

Cites Work

• The Covering Radius of the $(m - 3)$rd Order Reed Muller Codes and a Lower Bound on the $(m - 4)$th Order Reed Muller Codes
• Covering radius---Survey and recent results
• The covering radius of the (128,8) Reed-Muller code is 56 (Corresp.)
• The second order Reed-Muller code of length 64 has covering radius 18 (Corresp.)
• On the covering radius of binary codes (Corresp.)
• Some results on the covering radii of Reed-Muller codes
• The covering radius of the<tex>(2^{15}, 16)</tex>Reed-Muller code is at least 16276

This page was built for publication: Some inequalities about the covering radius of Reed-Muller codes