An improved list decoding algorithm for the second order Reed-Muller codes and its applications
From MaRDI portal
Publication:1009075
DOI10.1007/S10623-008-9184-8zbMATH Open1178.94222OpenAlexW2029867410MaRDI QIDQ1009075FDOQ1009075
Authors: Rafaël Fourquet, Cédric Tavernier 
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
Recommendations
- List decoding of the first-order binary Reed-Muller codes
- List Decoding of<tex>$q$</tex>-ary Reed–Muller Codes
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- On a recursive decoding algorithm for some subsets of first order Reed- Muller codes
- scientific article; zbMATH DE number 1594297
Cites Work
- Title not available (Why is that?)
- Improving the Upper Bounds on the Covering Radii of Binary Reed–Muller Codes
- Weight enumerator for second-order Reed-Muller codes
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- The second order Reed-Muller code of length 64 has covering radius 18 (Corresp.)
- List decoding of the first-order binary Reed-Muller codes
- List Decoding of<tex>$q$</tex>-ary Reed–Muller Codes
- Title not available (Why is that?)
- Some results on the covering radii of Reed-Muller codes
- Recursive Decoding and Its Performance for Low-Rate Reed–Muller Codes
Cited In (18)
- On lower bounds of second-order nonlinearities of cubic bent functions constructed by concatenating Gold functions
- List-decoding Barnes-Wall lattices
- On third-order nonlinearity of biquadratic monomial Boolean functions
- The covering radius of the Reed-Muller code \(\text{RM}(2, 7)\) is \(40\)
- On second-order nonlinearity and maximum algebraic immunity of some bent functions in \(\mathcal{PS}^{+}\)
- On higher order nonlinearities of Boolean functions
- The lower bounds on the second-order nonlinearity of three classes of Boolean functions
- Boolean function classes with high nonlinearity
- Higher-order nonlinearity of Kasami functions
- More vectorial Boolean functions with unbounded nonlinearity profile
- Third-order nonlinearities of a subclass of Kasami functions
- On the lower bounds of the second order nonlinearities of some Boolean functions
- New bounds on the covering radius of the second order Reed-Muller code of length 128
- On the Higher Order Nonlinearities of Boolean Functions and S-Boxes, and Their Generalizations
- Improved lower bounds on higher order nonlinearity
- On the higher-order nonlinearity of a Boolean bent function class (constructed via Niho power functions)
- List decoding of the first-order binary Reed-Muller codes
- A lower bound on the third-order nonlinearity of the simplest \(\mathcal{PS}_{a p}\) bent functions
This page was built for publication: An improved list decoding algorithm for the second order Reed-Muller codes and its applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1009075)
