Sequential decoding with adaptive reordering of codeword trees

Branko Radosavljevic, Erdal Arikan, Bruce Hajek

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish (US)
Title of host publicationProceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages1
ISBN (Electronic)0780300564
DOIs
StatePublished - Jan 1 1991
Event1991 IEEE International Symposium on Information Theory, ISIT 1991 - Budapest, Hungary
Duration: Jun 24 1991Jun 28 1991

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Conference

Conference1991 IEEE International Symposium on Information Theory, ISIT 1991
Country/TerritoryHungary
CityBudapest
Period6/24/916/28/91

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Sequential decoding with adaptive reordering of codeword trees'. Together they form a unique fingerprint.

Cite this