Iterative List Decoding

Jørn Justesen, Tom Høholdt, Johan Hjaltason

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

317 Downloads (Pure)

Abstract

We analyze the relation between iterative decoding and the extended parity check matrix. By considering a modified version of bit flipping, which produces a list of decoded words, we derive several relations between decodable error patterns and the parameters of the code. By developing a tree of codewords at minimal distance from the received vector, we also obtain new information about the code.
Original languageEnglish
Title of host publicationProceedings of Information Theory Workshop on Coding and Complexity
Publication date2005
ISBN (Print)0-7803-9481-X
DOIs
Publication statusPublished - 2005
EventIEEE Information Theory Society : Information Theory Workshop 2005 on Coding and Complexity - Roturua, New Zealand
Duration: 1 Jan 2005 → …

Conference

ConferenceIEEE Information Theory Society : Information Theory Workshop 2005 on Coding and Complexity
CityRoturua, New Zealand
Period01/01/2005 → …

Bibliographical note

Copyright: 2005 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE

Fingerprint Dive into the research topics of 'Iterative List Decoding'. Together they form a unique fingerprint.

Cite this