Computing the threshold shift for general channels

Jeremie Ezri, Rüdiger Urbanke, Andrea Montanari, Sewoong Oh

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

Abstract

The 'threshold' of a code ensemble can be defined as the noise level at which the block error probability curve crosses 1/2. For ensembles of low-density parity check codes used over the binary erasure channel, the behavior of the threshold for large blocklengths is known in detail. It is characterized by an asymptotic threshold value, and a finite-blocklength shift parameter. Here we present a new method for computing the shift parameter that can be applied to general binary memoryless symmetric channels, and general message passing algorithms. We check that the new approach recovers the known parameters for erasure correction.

Original languageEnglish (US)
Title of host publicationProceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008
Pages1448-1452
Number of pages5
DOIs
StatePublished - Sep 29 2008
Event2008 IEEE International Symposium on Information Theory, ISIT 2008 - Toronto, ON, Canada
Duration: Jul 6 2008Jul 11 2008

Publication series

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

Other

Other2008 IEEE International Symposium on Information Theory, ISIT 2008
CountryCanada
CityToronto, ON
Period7/6/087/11/08

    Fingerprint

ASJC Scopus subject areas

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

Cite this

Ezri, J., Urbanke, R., Montanari, A., & Oh, S. (2008). Computing the threshold shift for general channels. In Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008 (pp. 1448-1452). [4595227] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2008.4595227