Sequential Decoding of Low-Density Parity-Check Codes by Adaptive Reordering of Parity Checks
Date
1992
Authors
Radosavljevic, B.
Arikan, E.
Hajek, B.
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
IEEE Transactions on Information Theory
Print ISSN
189448
Electronic ISSN
Publisher
Volume
38
Issue
6
Pages
1833 - 1839
Language
English
Type
Journal Title
Journal ISSN
Volume Title
Series
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. © 1992 IEEE