Pseudo-codeword Landscape
| dc.creator | Chertkov, Michael | |
| dc.creator | Stepanov, Mikhail | |
| dc.date | 2007-01-12 | |
| dc.date | 2007-04-22 | |
| dc.date.accessioned | 2026-07-07T08:16:57Z | |
| dc.date.available | 2026-07-07T08:16:57Z | |
| dc.description | We discuss the performance of Low-Density-Parity-Check (LDPC) codes decoded by means of Linear Programming (LP) at moderate and large Signal-to-Noise-Ratios (SNR). Utilizing a combination of the previously introduced pseudo-codeword-search method and a new "dendro" trick, which allows us to reduce the complexity of the LP decoding, we analyze the dependence of the Frame-Error-Rate (FER) on the SNR. Under Maximum-A-Posteriori (MAP) decoding the dendro-code, having only checks with connectivity degree three, performs identically to its original code with high-connectivity checks. For a number of popular LDPC codes performing over the Additive-White-Gaussian-Noise (AWGN) channel we found that either an error-floor sets at a relatively low SNR, or otherwise a transient asymptote, characterized by a faster decay of FER with the SNR increase, precedes the error-floor asymptote. We explain these regimes in terms of the pseudo-codeword spectra of the codes. | |
| dc.description | 5 pages, 2 figures, proceedings of ISIT '07 | |
| dc.identifier | https://arxiv.org/abs/cs/0701084 | |
| dc.identifier | http://arxiv.org/abs/cs/0701084 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/133970 | |
| dc.subject | Information Theory | |
| dc.subject | Statistical Mechanics | |
| dc.title | Pseudo-codeword Landscape | |
| dc.type | text |