Finite-length scaling for iteratively decoded LDPC ensembles
IEEE Transactions on Information Theory
The design of efficiently-encodable rate-compatible LDPC codes
IEEE Transactions on Communications
Modern Coding Theory
Design of capacity-approaching irregular low-density parity-check codes
IEEE Transactions on Information Theory
Rate-compatible puncturing of low-density parity-check codes
IEEE Transactions on Information Theory
Rate-compatible punctured low-density parity-check codes with short block lengths
IEEE Transactions on Information Theory
Results on Punctured Low-Density Parity-Check Codes and Improved Iterative Decoding Techniques
IEEE Transactions on Information Theory
Capacity Achieving LDPC Codes Through Puncturing
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
This paper is devoted to the analysis of finite-length iterative performance of punctured LDPC ensembles in the waterfall region, assuming the transmission over the binary erasure channel (BEC). The analysis is carried out using the scaling approach proposed in [1]. Two punctured ensembles are considered: (a) randomly punctured ensembles, in the sense that each bit of a codeword is punctured with some puncturing probability; (b) ensembles with a fixed puncturing fraction of bits of each degree. In both cases, parameters of the scaling approximation are completely determined in terms of the ensemble parameters such as left, right and puncturing degree distributions.