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

A. Ashikhmin, S. Litsyn

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We present new MAP decoding algorithms for first order Reed-Muller and Hamming codes. The proposed algorithms have complexities proportional to n × log2(n), where n is the code length.

Original languageEnglish
Title of host publicationProceedings - 2003 IEEE Information Theory Workshop, ITW 2003
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages18-21
Number of pages4
ISBN (Electronic)0780377990, 9780780377998
DOIs
StatePublished - 2003
Event2003 IEEE Information Theory Workshop, ITW 2003 - Paris, France
Duration: 31 Mar 20034 Apr 2003

Publication series

NameProceedings - 2003 IEEE Information Theory Workshop, ITW 2003

Conference

Conference2003 IEEE Information Theory Workshop, ITW 2003
Country/TerritoryFrance
CityParis
Period31/03/034/04/03

Fingerprint

Dive into the research topics of 'Simple MAP decoding of first order Reed-Muller and Hamming codes'. Together they form a unique fingerprint.

Cite this