The Covering Radius of the Reed–Muller Code RM(m – 4, m) in RM(m – 3, m)

DOI10.1109/TIT.2021.3120754zbMath1489.94201arXiv2106.13910OpenAlexW3211598911MaRDI QIDQ5030307

Randall Dougherty, R. Daniel Mauldin, Mark Tiefenbruck

Publication date: 17 February 2022

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.13910

zbMATH Keywords

covering radiusReed-Muller codedistance from Boolean polynomial

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75) Boolean functions (94D10)

Related Items (2)

Classification of some cosets of the Reed-Muller code ⋮ Some algebraic questions about the Reed-Muller code

This page was built for publication: The Covering Radius of the Reed–Muller Code RM(m – 4, m) in RM(m – 3, m)