Sequential Decoding of Low-Density Parity-Check Codes by Adaptive Reordering of Parity Checks

Branko Radosavljevic, Erdal Arikan, Bruce Hajek

Research output: Contribution to journalArticlepeer-review

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 languageEnglish (US)
Pages (from-to)1833-1839
Number of pages7
JournalIEEE Transactions on Information Theory
Volume38
Issue number6
DOIs
StatePublished - Nov 1992
Externally publishedYes

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Fingerprint

Dive into the research topics of 'Sequential Decoding of Low-Density Parity-Check Codes by Adaptive Reordering of Parity Checks'. Together they form a unique fingerprint.

Cite this