New bounds on the covering radius of the second order Reed-Muller code of length 128
From MaRDI portal
Publication:1733981
DOI10.1007/s12095-018-0289-2zbMath1409.94947MaRDI QIDQ1733981
Qichun Wang, Pantelimon Stănică
Publication date: 22 March 2019
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-018-0289-2
94B65: Bounds on codes
Related Items
On higher order nonlinearities of Boolean functions, On the covering radius of the third order Reed-Muller code \(\mathrm{RM}(3, 7)\), A trigonometric sum sharp estimate and new bounds on the nonlinearity of some cryptographic Boolean functions, The covering radius of the Reed-Muller code \(\text{RM}(2, 7)\) is \(40\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Four decades of research on bent functions
- An improved list decoding algorithm for the second order Reed-Muller codes and its applications
- On the covering radius of Reed-Muller codes
- On ``bent functions
- On the covering radius of the third order Reed-Muller code \(\mathrm{RM}(3, 7)\)
- \(GL(m,2)\) acting on \(R(r,m)/R(r-1,m)\)
- On the Covering Radii of Binary Reed–Muller Codes in the Set of Resilient Boolean Functions
- Improving the Upper Bounds on the Covering Radii of Binary Reed–Muller Codes
- The second order Reed-Muller code of length 64 has covering radius 18 (Corresp.)
- A Classification of the Cosets of the Reed-Muller Code R (1, 6)
- Bent Functions
