Fast maximum likelihood decoding of Reed-Muller codes

MaRDI QIDQ3362151zbMATH OpenFDO

Authors V. V. Zyablov, Stephen Portnoy

Publication date 1991

Full work available at URL http://mathnet.ru/eng/ppi/v27/i4/p39

zbMATH Keywords

Reed-Muller codeserror probabilitycomplexity and quality estimationsfast maximum likelihood decoding algorithmsignal/noise ratioViterbi-Wolf decoding method

Mathematics Subject Classification ID

Decoding (94B35)

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

Cited in

(11)

• Fast Essentially Maximum Likelihood Decoding of the Golden Code
• scientific article; zbMATH DE number 4164732 (Why is no real title available?)
• 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
• scientific article; zbMATH DE number 3920373 (Why is no real title available?)
• Maximum-Likelihood Decoding of Reed–Solomon Codes is NP-Hard
• Fast decoding of non-binary first order Reed-Muller codes
• Simple Codes and Sparse Recovery with Fast Decoding
• Maximum-likelihood decoding of Reed-Solomon codes is NP-hard
• On Viterbi-like algorithms and their application to Reed-Muller codes

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)