List decoding of the first-order binary Reed-Muller codes
From MaRDI portal
Recommendations
- An improved list decoding algorithm for the second order Reed-Muller codes and its applications
- Fast decoding algorithms for first order Reed-Muller and related codes
- Fast decoding of non-binary first order Reed-Muller codes
- Decoding of Reed-Muller codes with a large number of errors
- scientific article; zbMATH DE number 3920373
Cites work
Cited in
(16)- A lower bound on the third-order nonlinearity of the simplest \(\mathcal{PS}_{a p}\) bent functions
- The lower bounds on the second order nonlinearity of three classes of Boolean functions with high nonlinearity
- An improved list decoding algorithm for the second order Reed-Muller codes and its applications
- On higher order nonlinearities of Boolean functions
- The lower bounds on the second-order nonlinearity of three classes of Boolean functions
- On a recursive algorithm of decoding some subsets of the first-order Reed-Muller codes
- Higher-order nonlinearity of Kasami functions
- The lower bound on the second-order nonlinearity of a class of Boolean functions with high nonlinearity
- List Decoding of<tex>$q$</tex>-ary Reed–Muller Codes
- Simple MAP Decoding of First-Order Reed–Muller and Hamming Codes
- Third-order nonlinearities of a subclass of Kasami functions
- On the lower bounds of the second order nonlinearities of some Boolean functions
- Fast decoding of non-binary first order Reed-Muller codes
- On the Higher Order Nonlinearities of Boolean Functions and S-Boxes, and Their Generalizations
- List decoding of repeated codes
- On the higher-order nonlinearity of a Boolean bent function class (constructed via Niho power functions)
This page was built for publication: List decoding of the first-order binary Reed-Muller codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q927477)
