Fast maximum likelihood decoding of Reed-Muller codes
From MaRDI portal
Publication:3362151
zbMATH Open0752.94019MaRDI QIDQ3362151FDOQ3362151
Authors: V. V. Zyablov, Stephen Portnoy 
Publication date: 1991
Full work available at URL: http://mathnet.ru/eng/ppi/v27/i4/p39
Recommendations
- Fast decoding algorithms for first order Reed-Muller and related codes
- Decoding of Reed-Muller codes with a large number of errors
- Fast decoding of non-binary first order Reed-Muller codes
- scientific article; zbMATH DE number 3920373
- Soft-decision decoding of Reed-Muller codes as generalized multiple concatenated codes
Reed-Muller codeserror probabilitycomplexity and quality estimationsfast maximum likelihood decoding algorithmsignal/noise ratioViterbi-Wolf decoding method
Cited In (11)
- Title not available (Why is that?)
- Soft-decision decoding of Reed-Muller codes as generalized multiple concatenated codes
- Performance of Reed-Muller codes and a maximum-likelihood decoding algorithm for OFDM
- Rational maps and maximum likelihood decodings
- Title not available (Why is that?)
- Maximum-Likelihood Decoding of Reed–Solomon Codes is NP-Hard
- Simple Codes and Sparse Recovery with Fast Decoding
- Fast decoding of non-binary first order Reed-Muller codes
- Maximum-likelihood decoding of Reed-Solomon codes is NP-hard
- On Viterbi-like algorithms and their application to Reed-Muller codes
- Fast Essentially Maximum Likelihood Decoding of the Golden Code
This page was built for publication: Fast maximum likelihood decoding of Reed-Muller codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3362151)
