Practical loss-resilient codes
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On the construction of some capacity-approaching coding schemes
On the construction of some capacity-approaching coding schemes
Path Pruning for Unequal Error Protection Turbo Codes
IZS '06 Proceedings of the 2006 International Zurich Seminar on Communications
The capacity of low-density parity-check codes under message-passing decoding
IEEE Transactions on Information Theory
Design of capacity-approaching irregular low-density parity-check codes
IEEE Transactions on Information Theory
Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation
IEEE Transactions on Information Theory
Nonuniform error correction using low-density parity-check codes
IEEE Transactions on Information Theory
Rateless Codes With Unequal Error Protection Property
IEEE Transactions on Information Theory
Progressive Transmission of Images Over Fading Channels Using Rate-Compatible LDPC Codes
IEEE Transactions on Image Processing
Error resilience in current distributed video coding architectures
Journal on Image and Video Processing - Special issue on distributed video coding
Unequal error protection: an information-theoretic perspective
IEEE Transactions on Information Theory
Design of bandwidth-efficient unequal error protection LDPC codes
IEEE Transactions on Communications
On the UEP capabilities of several LDPC construction algorithms
IEEE Transactions on Communications
UEP concepts in modulation and coding
Advances in Multimedia
Improved design of unequal error protection LDPC codes
EURASIP Journal on Wireless Communications and Networking
| Hi-index | 0.06 |
It has been widely recognized in the literature that irregular low-density parity-check (LDPC) codes exhibit naturally an unequal error protection (UEP) behavior. In this paper, we propose a general method to emphasize and control the UEP properties of LDPC codes. The method is based on a hierarchical optimization of the bit node irregularity profile for each sensitivity class within the codeword by maximizing the average bit node degree while guaranteeing a minimum degree as high as possible. We show that this optimization strategy is efficient, since the codes that we optimize show better UEP capabilities than the codes optimized for the additive white Gaussian noise channel.