New advances in permutation decoding of first-order Reed-Muller codes
From MaRDI portal
Recommendations
- Partial permutation decoding for the first-order Reed-Muller codes
- Reed-Muller codes and permutation decoding
- Improved partial permutation decoding for Reed-Muller codes
- Fast decoding algorithms for first order Reed-Muller and related codes
- On a recursive decoding algorithm for some subsets of first order Reed- Muller codes
Cites work
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1284429 (Why is no real title available?)
- scientific article; zbMATH DE number 1284430 (Why is no real title available?)
- Information sets and partial permutation decoding for codes from finite geometries
- Information Sets From Defining Sets for Reed–Muller Codes of First and Second Order
- Minimal permutation sets for decoding the binary Golay codes (Corresp.)
- On coverings
- Partial Permutation Decoding for Abelian Codes
- Partial permutation decoding for binary linear and \(\mathbb Z_4\)-linear Hadamard codes
- Partial permutation decoding for codes from finite planes
- Partial permutation decoding for the first-order Reed-Muller codes
- PD-sets for binary RM-codes and the codes related to the Klein quadric and to the Schubert variety of \(\mathrm{PG}(5,2)\)
- Permutation Decoding of Systematic Codes
- Reed-Muller codes and permutation decoding
Cited in
(4)
This page was built for publication: New advances in permutation decoding of first-order Reed-Muller codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2701051)
