Fast decoding algorithms for first order Reed-Muller and related codes
From MaRDI portal
Recommendations
Cited in
(16)- scientific article; zbMATH DE number 820512 (Why is no real title available?)
- Simple MAP Decoding of First-Order Reed–Muller and Hamming Codes
- scientific article; zbMATH DE number 4172911 (Why is no real title available?)
- New advances in permutation decoding of first-order Reed-Muller codes
- Fast decoding of non-binary first order Reed-Muller codes
- List decoding of the first-order binary Reed-Muller codes
- Fast Encoding Algorithms for Reed–Solomon Codes With Between Four and Seven Parity Symbols
- scientific article; zbMATH DE number 3920373 (Why is no real title available?)
- scientific article; zbMATH DE number 177859 (Why is no real title available?)
- On a recursive algorithm of decoding some subsets of the first-order Reed-Muller codes
- Implementation of a fast maximum-likelihood decoding algorithm for the extended Nordstrom-Robinson code
- scientific article; zbMATH DE number 4164732 (Why is no real title available?)
- The Nordstrom-Robinson code: representation over GF(4) and efficient decoding
- Fast maximum likelihood decoding of Reed-Muller codes
- On a recursive decoding algorithm for some subsets of first order Reed- Muller codes
- scientific article; zbMATH DE number 4008277 (Why is no real title available?)
This page was built for publication: Fast decoding algorithms for first order Reed-Muller and related codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1910431)
