Finite-Length Scaling for Iteratively Decoded LDPC Ensembles
| dc.creator | Amraoui, Abdelaziz | |
| dc.creator | Montanari, Andrea | |
| dc.creator | Richardson, Tom | |
| dc.creator | Urbanke, Ruediger | |
| dc.date | 2004-06-26 | |
| dc.date.accessioned | 2026-07-07T08:15:14Z | |
| dc.date.available | 2026-07-07T08:15:14Z | |
| dc.description | In this paper we investigate the behavior of iteratively decoded low-density parity-check codes over the binary erasure channel in the so-called ``waterfall region." We show that the performance curves in this region follow a very basic scaling law. We conjecture that essentially the same scaling behavior applies in a much more general setting and we provide some empirical evidence to support this conjecture. The scaling law, together with the error floor expressions developed previously, can be used for fast finite-length optimization. | |
| dc.description | 45 pages, 14 figures | |
| dc.identifier | https://arxiv.org/abs/cs/0406050 | |
| dc.identifier | http://arxiv.org/abs/cs/0406050 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/133384 | |
| dc.subject | Information Theory | |
| dc.subject | Disordered Systems and Neural Networks | |
| dc.subject | Discrete Mathematics | |
| dc.title | Finite-Length Scaling for Iteratively Decoded LDPC Ensembles | |
| dc.type | text |