Connections between problematic trapping sets and deviations on the computation trees of LDPC codes

Eric T. Psota, Lance C. Pérez

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

1 Scopus citations

Abstract

The error mechanisms of iterative message-passing decoders with low-density parity-check codes are studied. The connections between trapping sets and deviations on computation trees are explored in depth in an attempt to bridge experimental and analytic approaches to these error mechanisms. An iterative algorithm for finding low-weight trapping sets is presented along with a method for characterizing the weight of deviations that result from trapping sets.

Original languageEnglish (US)
Title of host publication6th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2010
Pages472-476
Number of pages5
DOIs
StatePublished - Nov 29 2010
Event6th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2010 - Brest, France
Duration: Sep 6 2010Sep 10 2010

Publication series

Name6th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2010

Other

Other6th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2010
CountryFrance
CityBrest
Period9/6/109/10/10

    Fingerprint

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Information Systems
  • Theoretical Computer Science

Cite this

Psota, E. T., & Pérez, L. C. (2010). Connections between problematic trapping sets and deviations on the computation trees of LDPC codes. In 6th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2010 (pp. 472-476). [5613852] (6th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2010). https://doi.org/10.1109/ISTC.2010.5613852