Upper bound on the error exponent of regular LDPC codes transmitted over the BEC

Idan Goldenberg*, David Burshtein

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The error performance of the ensemble of typical LDPC codes transmitted over the binary erasure channel (BEC) is analyzed under iterative decoding. In the past, lower bounds on the error exponent were derived. In this paper a probabilistic upper bound on this error exponent is derived. This bound holds with some confidence level.

Original languageEnglish
Title of host publication2008 5th International Symposium on Turbo Codes and Related Topics, TURBOCODING
Pages1-6
Number of pages6
DOIs
StatePublished - 2008
Event2008 5th International Symposium on Turbo Codes and Related Topics, TURBOCODING - Lausanne, Switzerland
Duration: 1 Sep 20085 Sep 2008

Publication series

Name2008 5th International Symposium on Turbo Codes and Related Topics, TURBOCODING

Conference

Conference2008 5th International Symposium on Turbo Codes and Related Topics, TURBOCODING
Country/TerritorySwitzerland
CityLausanne
Period1/09/085/09/08

Keywords

  • Binary erasure channel (BEC)
  • Block codes
  • Error exponent
  • Expurgated ensemble
  • Iterative decoding
  • Low-density parity-check (LDPC) codes
  • Stopping sets

Fingerprint

Dive into the research topics of 'Upper bound on the error exponent of regular LDPC codes transmitted over the BEC'. Together they form a unique fingerprint.

Cite this