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 | |
State | Published - Nov 1992 |
Externally published | Yes |
ASJC Scopus subject areas
- Information Systems
- Computer Science Applications
- Library and Information Sciences