An improved list decoding algorithm for the second order Reed-Muller codes and its applications

DOI10.1007/s10623-008-9184-8zbMath1178.94222OpenAlexW2029867410MaRDI QIDQ1009075

Cédric Tavernier, Rafaël Fourquet

Publication date: 31 March 2009

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

Full work available at URL: https://doi.org/10.1007/s10623-008-9184-8

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cryptography (94A60) Bounds on codes (94B65) Decoding (94B35)

Related Items (16)

On lower bounds of second-order nonlinearities of cubic bent functions constructed by concatenating Gold functions ⋮ On third-order nonlinearity of biquadratic monomial Boolean functions ⋮ MORE VECTORIAL BOOLEAN FUNCTIONS WITH UNBOUNDED NONLINEARITY PROFILE ⋮ On the lower bounds of the second order nonlinearities of some Boolean functions ⋮ Third-order nonlinearities of a subclass of Kasami functions ⋮ List-decoding Barnes-Wall lattices ⋮ On higher order nonlinearities of Boolean functions ⋮ The lower bounds on the second-order nonlinearity of three classes of Boolean functions ⋮ A lower bound on the third-order nonlinearity of the simplest \(\mathcal{PS}_{a p}\) bent functions ⋮ Unnamed Item ⋮ New bounds on the covering radius of the second order Reed-Muller code of length 128 ⋮ Higher-order nonlinearity of Kasami functions ⋮ On the Higher Order Nonlinearities of Boolean Functions and S-Boxes, and Their Generalizations ⋮ On second-order nonlinearity and maximum algebraic immunity of some bent functions in \(\mathcal{PS}^{+}\) ⋮ The covering radius of the Reed-Muller code \(\text{RM}(2, 7)\) is \(40\) ⋮ On the higher-order nonlinearity of a Boolean bent function class (constructed via Niho power functions)

Cites Work

• Unnamed Item
• Unnamed Item
• List decoding of the first-order binary Reed-Muller codes
• Recursive Decoding and Its Performance for Low-Rate Reed–Muller Codes
• List Decoding of<tex>$q$</tex>-ary Reed–Muller Codes
• 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.)
• Some results on the covering radii of Reed-Muller codes
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• Weight enumerator for second-order Reed-Muller codes

This page was built for publication: An improved list decoding algorithm for the second order Reed-Muller codes and its applications