Simple MAP Decoding of First-Order Reed–Muller and Hamming Codes

DOI10.1109/TIT.2004.831835MaRDI QIDQ3546507zbMATH OpenOpenAlexFDO

Authors Alexei Ashikhmin, Simon Litsyn

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2004.831835

zbMATH Keywords

Hamming codesmaximum a posteriori (MAP) decodingReed-Muller codes.

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Analysis of algorithms and problem complexity (68Q25) Linear codes (general theory) (94B05) Decoding (94B35)

Recommendations

• scientific article; zbMATH DE number 1092937
• Fast decoding algorithms for first order Reed-Muller and related codes
• Fast decoding of non-binary first order Reed-Muller codes
• List decoding of the first-order binary Reed-Muller codes
• Fast decoding algorithm for first-order Reed-Muller codes
• Soft-decision decoding of Reed-Muller codes: a simplified algorithm
• On a recursive decoding algorithm for some subsets of first order Reed- Muller codes
• Reed-Muller codes and permutation decoding
• On a recursive algorithm of decoding some subsets of the first-order Reed-Muller codes
• scientific article; zbMATH DE number 3920373

Cited in

(7)

• A systematic approach to modified BCJR MAP algorithms for convolutional codes
• scientific article; zbMATH DE number 1486636 (Why is no real title available?)
• A Simple Soft-Input/Soft-Output Decoder for Hamming Codes
• A forward-only recursion algorithm for MAP decoding of linear block codes
• Subcodes of Reed-Solomon Codes Suitable for Soft Decoding
• Integer codes correcting single errors and detecting double adjacent errors
• Rational maps and maximum likelihood decodings

This page was built for publication: Simple MAP Decoding of First-Order Reed–Muller and Hamming Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546507)