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
BUIR Usage Stats
1
views
views
24
downloads
downloads
Citation Stats
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
Source Title
IEEE Transactions on Information Theory
Publisher
Course
Other identifiers
Book Title
Degree Discipline
Degree Level
Degree Name
Citation
Permalink
Published Version (Please cite this version)
Language
English