Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Conferences, Workshops, Symposiums, and Seminars
  4. Decay of Correlations: An Application to Low-Density Parity Check codes
 
conference paper

Decay of Correlations: An Application to Low-Density Parity Check codes

Kudekar, Shrinivas  
•
Macris, Nicolas  
2008
Turbo Codes and Related Topics, 2008 5th International Symposium on
5th International Symposium on Turbo Codes and Related Topics

Recently the decay of correlations between bits of low density generator matrix (LDGM) codes have been investigated by using high temperature expansions from statistical physics \cite{KuMa07}. In this work we apply these ideas to a special class of low density parity check codes (LDPC) on the binary input gaussian white noise channel (BIAWGNC). We give a rigorous derivation of the MAP GEXIT curve (the derivative with respect to the noise parameter of the input-output conditional entropy) for high values of the noise. Our result agrees with the formal expressions obtainable from replica calculations, and is the first result that fully justifies the replica formulas beyond the binary erasure channel (BEC). The ensemble of LDPC codes considered here is constructed by adding randomly a sufficient fraction $p$ of degree one variable nodes to a standard irregular LDPC$(\Lambda, P)$ Tanner graphs.

  • Files
  • Details
  • Metrics
Loading...
Thumbnail Image
Name

main.pdf

Access type

openaccess

Size

127.4 KB

Format

Adobe PDF

Checksum (MD5)

e21c5a9a7cd2a4307c6c88a0db81adbd

Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés