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

DOI10.1007/BF01388415zbMATH Open0770.94007OpenAlexW1979853813MaRDI QIDQ1802196FDOQ1802196

Authors: Xiang-Dong Hou 

Publication date: 13 September 1993

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

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

Recommendations

• Some results on the covering radii of Reed-Muller codes
• New bounds on the covering radius of the second order Reed-Muller code of length 128
• Some inequalities about the covering radius of Reed-Muller codes
• On the norm and covering radius of the first-order Reed-Muller codes
• On the covering radius of Reed-Muller codes

zbMATH Keywords

upper boundcovering radius\(r\)th order Reed-Muller code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cites Work

• On ``bent functions
• Covering radius---Survey and recent results
• The second order Reed-Muller code of length 64 has covering radius 18 (Corresp.)
• Weight distributions of the cosets of the (32,6) Reed-Muller code
• The covering radius of the (128,8) Reed-Muller code is 56 (Corresp.)
• The covering radius of the<tex>(2^{15}, 16)</tex>Reed-Muller code is at least 16276
• On the covering radius of binary codes (Corresp.)
• Title not available (Why is that?)
• Some results on the covering radii of Reed-Muller codes
• Some inequalities about the covering radius of Reed-Muller codes
• 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

Cited In (20)

• Covering radius---Survey and recent results
• The covering radius of the Reed-Muller code \(\text{RM}(2, 7)\) is \(40\)
• Title not available (Why is that?)
• New Covering Radius of Reed–Muller Codes for<tex>$t$</tex>-Resilient Functions
• Some results on the covering radii of Reed-Muller codes
• Title not available (Why is that?)
• Theoretical upper bounds on the covering radii of Boolean functions
• The covering radius of the (128,8) Reed-Muller code is 56 (Corresp.)
• The Covering Radius of the Reed–Muller Code RM(m – 4, m) in RM(m – 3, m)
• On the norm and covering radius of the first-order Reed-Muller codes
• Bounds for the multicovering radii of Reed-Muller codes with applications to stream ciphers
• On the covering radius of the third order Reed-Muller code \(\mathrm{RM}(3, 7)\)
• New bounds on the covering radius of the second order Reed-Muller code of length 128
• On the covering radius of Reed-Muller codes
• Some inequalities about the covering radius of Reed-Muller codes
• On the covering radius of Reed-Solomon codes
• Improving the Upper Bounds on the Covering Radii of Binary Reed–Muller Codes
• \(GL(m,2)\) acting on \(R(r,m)/R(r-1,m)\)
• Title not available (Why is that?)
• The Reed-Muller code \(R(1,7)\) is normal

This page was built for publication: Further results on the covering radii of the Reed-Muller codes

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