Decay of Correlations in Low Density Parity Check Codes: Low Noise Regime
| dc.creator | Kudekar, Shrinivas | |
| dc.creator | Macris, Nicolas | |
| dc.date | 2009-01-23 | |
| dc.date.accessioned | 2026-07-07T12:33:41Z | |
| dc.date.available | 2026-07-07T12:33:41Z | |
| dc.description | Consider transmission over a binary additive white gaussian noise channel using a fixed low-density parity check code. We consider the posterior measure over the code bits and the corresponding correlation between two codebits, averaged over the noise realizations. We show that for low enough noise variance this average correlation decays exponentially fast with the graph distance between the code bits. One consequence of this result is that for low enough noise variance the GEXIT functions (further averaged over a standard code ensemble) of the belief propagation and optimal decoders are the same. | |
| dc.description | 5 pages, submitted to ISIT 2009 | |
| dc.identifier | https://arxiv.org/abs/0901.3630 | |
| dc.identifier | http://arxiv.org/abs/0901.3630 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/217216 | |
| dc.subject | Information Theory | |
| dc.title | Decay of Correlations in Low Density Parity Check Codes: Low Noise Regime | |
| dc.type | text |