Practical loss-resilient codes
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Modern Coding Theory
Good error-correcting codes based on very sparse matrices
IEEE Transactions on Information Theory
Nonuniform error correction using low-density parity-check codes
IEEE Transactions on Information Theory
Hi-index | 0.00 |
In this paper, we explore a novel approach to evaluate the inherent UEP (unequal error protection) properties of irregular LDPC (low-density parity-check) codes over BECs (binary erasure channels). Exploiting the finite-length scaling methodology, suggested by Amraoui et. al., we introduce a scaling approach to approximate the bit erasure rates of variable nodes with different degrees in the waterfall region of the peeling decoder. Comparing the bit erasure rates obtained from Monte Carlo simulation with the proposed scaling approximations, we demonstrate that the scaling approach provides a close approximation for a wide range of code lengths (between 1000 and 8000). In view of the complexity associated with the numerical evaluation of the scaling approximation, we also derive simpler upper and lower bounds.