TY - GEN
T1 - Sequential decoding with adaptive reordering of codeword trees
AU - Radosavljevic, Branko
AU - Arikan, Erdal
AU - Hajek, Bruce
N1 - Publisher Copyright:
© 1991 Institute of Electrical and Electronics Engineers Inc. All rights reserved.
PY - 1991
Y1 - 1991
N2 - Decoding algorithms are investigated in which 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 and binary symmetric channels. They suggest that for small erasure probability, the method is computationally feasible at rates above the computational cutoff rate.
AB - Decoding algorithms are investigated in which 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 and binary symmetric channels. They suggest that for small erasure probability, the method is computationally feasible at rates above the computational cutoff rate.
UR - http://www.scopus.com/inward/record.url?scp=85067437098&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85067437098&partnerID=8YFLogxK
U2 - 10.1109/ISIT.1991.695348
DO - 10.1109/ISIT.1991.695348
M3 - Conference contribution
AN - SCOPUS:85067437098
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 292
BT - Proceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 1991 IEEE International Symposium on Information Theory, ISIT 1991
Y2 - 24 June 1991 through 28 June 1991
ER -