Some results on the covering radii of Reed-Muller codes
From MaRDI portal
Publication:4202055
DOI10.1109/18.212268zbMath0777.94015OpenAlexW2145819400MaRDI QIDQ4202055
Publication date: 12 December 1993
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.212268
Related Items (6)
\(GL(m,2)\) acting on \(R(r,m)/R(r-1,m)\) ⋮ On the covering radius of the third order Reed-Muller code \(\mathrm{RM}(3, 7)\) ⋮ Some inequalities about the covering radius of Reed-Muller codes ⋮ Further results on the covering radii of the Reed-Muller codes ⋮ An improved list decoding algorithm for the second order Reed-Muller codes and its applications ⋮ The covering radius of the Reed-Muller code \(\text{RM}(2, 7)\) is \(40\)
This page was built for publication: Some results on the covering radii of Reed-Muller codes
