FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
New Sequences of Linear Time Erasure Codes Approaching the Channel Capacity
AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Efficient erasure correcting codes
IEEE Transactions on Information Theory
Design of capacity-approaching irregular low-density parity-check codes
IEEE Transactions on Information Theory
A broadcast approach for a single-user slowly fading MIMO channel
IEEE Transactions on Information Theory
Bounds on achievable rates of LDPC codes used over the binary erasure channel
IEEE Transactions on Information Theory
Optimal relay functionality for SNR maximization in memoryless relay networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
A binary erasure channel with erasure probability which can take one of two values is considered. Transmission is done by using a low density parity-check code under the requirement that completely successful decoding is possible when the channel is in its better state, while tolerating some predetermined residual erasure fraction when the channel is in its worse state. Upper bounds on the achievable design rate under iterative decoding are derived for this setting. These bounds are compared to rates obtained by practical code profiles. It is also observed that when exceeding the capacity of the erasure channel, the performance of such codes exhibits graceful degradation as measured by the residual erasure fraction.