Iterative List Decoding

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

doi:10.1109/ITW.2005.1531863

Iterative List Decoding

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

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

507 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 language	English
Title of host publication	Proceedings of Information Theory Workshop on Coding and Complexity
Publication date	2005
ISBN (Print)	0-7803-9481-X
DOIs	https://doi.org/10.1109/ITW.2005.1531863
Publication status	Published - 2005
Event	2005 IEEE Information Theory Workshop - Roturua, New Zealand Duration: 28 Aug 2005 → 2 Sept 2005

Conference

Conference	2005 IEEE Information Theory Workshop
Country/Territory	New Zealand
City	Roturua
Period	28/08/2005 → 02/09/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

Access to Document

10.1109/ITW.2005.1531863

JustesenFinal published version, 313 KB

OpenUrl availability

Full text

Cite this

@inproceedings{0f7d33c0856243028662b39b8963ce95,

title = "Iterative List Decoding",

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.",

author = "J{\o}rn Justesen and Tom H{\o}holdt and Johan Hjaltason",

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; 2005 IEEE Information Theory Workshop, ITW 2005 ; Conference date: 28-08-2005 Through 02-09-2005",

year = "2005",

doi = "10.1109/ITW.2005.1531863",

language = "English",

isbn = "0-7803-9481-X",

booktitle = "Proceedings of Information Theory Workshop on Coding and Complexity",

}

TY - GEN

T1 - Iterative List Decoding

AU - Justesen, Jørn

AU - Høholdt, Tom

AU - Hjaltason, Johan

N1 - 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

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

U2 - 10.1109/ITW.2005.1531863

DO - 10.1109/ITW.2005.1531863

M3 - Article in proceedings

SN - 0-7803-9481-X

BT - Proceedings of Information Theory Workshop on Coding and Complexity

T2 - 2005 IEEE Information Theory Workshop

Y2 - 28 August 2005 through 2 September 2005

ER -

Iterative List Decoding

Abstract

Conference

Bibliographical note

Access to Document

OpenUrl availability

Fingerprint

Cite this