Sequential Decoding of Low-Density Parity-Check Codes by Adaptive Reordering of Parity Checks

Branko Radosavljevic; Erdal Arikan; Bruce Hajek

doi:10.1109/18.165462

Sequential Decoding of Low-Density Parity-Check Codes by Adaptive Reordering of Parity Checks

Branko Radosavljevic, Erdal Arikan, Bruce Hajek

Research output: Contribution to journal › Article › peer-review

Abstract

Decoding algorithms are investigated in which unpruned codeword trees are generated from an ordered list of parity checks. The order is computed from the received message, and low-density parity-check codes are used to help control the growth of the tree. Simulation results are given for the binary erasure channel.

Original language	English (US)
Pages (from-to)	1833-1839
Number of pages	7
Journal	IEEE Transactions on Information Theory
Volume	38
Issue number	6
DOIs	https://doi.org/10.1109/18.165462
State	Published - Nov 1992
Externally published	Yes

ASJC Scopus subject areas

Information Systems
Computer Science Applications
Library and Information Sciences

Access to Document

10.1109/18.165462

Cite this

@article{4b1dfe5fb1dc4596a00f30c61ed89b99,

title = "Sequential Decoding of Low-Density Parity-Check Codes by Adaptive Reordering of Parity Checks",

abstract = "Decoding algorithms are investigated in which unpruned codeword trees are generated from an ordered list of parity checks. The order is computed from the received message, and low-density parity-check codes are used to help control the growth of the tree. Simulation results are given for the binary erasure channel.",

author = "Branko Radosavljevic and Erdal Arikan and Bruce Hajek",

year = "1992",

month = nov,

doi = "10.1109/18.165462",

language = "English (US)",

volume = "38",

pages = "1833--1839",

journal = "IRE Professional Group on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "6",

}

TY - JOUR

T1 - Sequential Decoding of Low-Density Parity-Check Codes by Adaptive Reordering of Parity Checks

AU - Radosavljevic, Branko

AU - Arikan, Erdal

AU - Hajek, Bruce

PY - 1992/11

Y1 - 1992/11

N2 - Decoding algorithms are investigated in which unpruned codeword trees are generated from an ordered list of parity checks. The order is computed from the received message, and low-density parity-check codes are used to help control the growth of the tree. Simulation results are given for the binary erasure channel.

AB - Decoding algorithms are investigated in which unpruned codeword trees are generated from an ordered list of parity checks. The order is computed from the received message, and low-density parity-check codes are used to help control the growth of the tree. Simulation results are given for the binary erasure channel.

UR - http://www.scopus.com/inward/record.url?scp=0026955723&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026955723&partnerID=8YFLogxK

U2 - 10.1109/18.165462

DO - 10.1109/18.165462

M3 - Article

AN - SCOPUS:0026955723

VL - 38

SP - 1833

EP - 1839

JO - IRE Professional Group on Information Theory

JF - IRE Professional Group on Information Theory

SN - 0018-9448

IS - 6

ER -

Sequential Decoding of Low-Density Parity-Check Codes by Adaptive Reordering of Parity Checks

Abstract

ASJC Scopus subject areas

Access to Document

Other links

Fingerprint

Cite this