Simple MAP decoding of first-order Reed-Muller and Hamming codes


A maximum a posteriori (MAP) probability decoder of a block code minimizes the probability of error for each transmitted symbol separately. The standard way of implementing MAP decoding of a linear code is the Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm, which is based on a trellis representation of the code. The complexity of the BCJR algorithm for the first… (More)
DOI: 10.1109/TIT.2004.831835



Citations per Year

82 Citations

Semantic Scholar estimates that this publication has 82 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Ashikhmin2004SimpleMD, title={Simple MAP decoding of first-order Reed-Muller and Hamming codes}, author={Alexei E. Ashikhmin and Simon Litsyn}, journal={IEEE Transactions on Information Theory}, year={2004}, volume={50}, pages={1812-1818} }