Soft-decision decoding of Reed-Muller codes: a simplified algorithm
From MaRDI portal
Recommendations
Cited in
(17)- On Viterbi-like algorithms and their application to Reed-Muller codes
- Constrained designs for maximum likelihood soft decoding of \(\text{RM} (2,m)\) and the extended Golay codes
- Simple MAP Decoding of First-Order Reed–Muller and Hamming Codes
- Soft-decision decoding of Reed-Muller codes: recursive lists
- Performance Analysis of Algebraic Soft-Decision Decoding of Reed–Solomon Codes
- A Recursive Hadamard Transform Optimal Soft Decision Decoding Algorithm
- A novel approach to soft decision decoding of threshold decodable codes (Corresp.)
- Suboptimum decoding of decomposable block codes
- scientific article; zbMATH DE number 1498802 (Why is no real title available?)
- Soft-decision majority decoding of Reed-Muller codes
- A Simple Soft-Input/Soft-Output Decoder for Hamming Codes
- Soft decision decoding of Reed Solomon codes using the Dorsch algorithm
- scientific article; zbMATH DE number 2154151 (Why is no real title available?)
- Soft-decision decoding of Reed-Muller codes as generalized multiple concatenated codes
- scientific article; zbMATH DE number 7258470 (Why is no real title available?)
- Recursive descriptions of polar codes
- Reed-Muller Codes
This page was built for publication: Soft-decision decoding of Reed-Muller codes: a simplified algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546823)