Decoding Reed-Muller codes beyond half the minimum distance
From MaRDI portal
Recommendations
Cited in
(20)- An improved list decoding algorithm for the second order Reed-Muller codes and its applications
- Weighted Reed-Muller codes revisited
- Decoding of Reed-Muller codes with a large number of errors
- Extractors from Reed-Muller codes
- Reed-Muller codes for random erasures and errors
- A Root-Finding Algorithm for List Decoding of Reed–Muller Codes
- scientific article; zbMATH DE number 4008277 (Why is no real title available?)
- scientific article; zbMATH DE number 67092 (Why is no real title available?)
- Efficient decoding of Reed-Solomon codes beyond half the minimum distance
- Decoding Reed-Muller codes over product sets
- scientific article; zbMATH DE number 6850352 (Why is no real title available?)
- Syndrome decoding of Reed-Muller codes and tensor decomposition over finite fields
- On the performance of Reed-Muller codes with respect to random errors and erasures
- An application of bivariate polynomial factorization on decoding of Reed-Solomon based codes
- Error-correction capability of Reed-Muller codes
- Efficiently decoding Reed-Muller codes from random errors
- Decoding Reed-Muller codes over product sets
- Correctable Errors of Weight Half the Minimum Distance Plus One for the First-Order Reed-Muller Codes
- Decoding variants of Reed-Muller codes over finite grids
- Minimum distance of relative Reed-Muller codes
This page was built for publication: Decoding Reed-Muller codes beyond half the minimum distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2712115)
