On the construction of some capacity-approaching coding schemes
On the construction of some capacity-approaching coding schemes
Modern Coding Theory
Efficient erasure correcting codes
IEEE Transactions on Information Theory
The capacity of low-density parity-check codes under message-passing decoding
IEEE Transactions on Information Theory
Extremes of information combining
IEEE Transactions on Information Theory
Finite-Dimensional Bounds on Zm and Binary LDPC Codes With Belief Propagation Decoders
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
We study the performance of LDPC codes over the cascaded BSC-BAWGN channel. This channel belongs to a family of binary-input, memoryless, symmetric-output channels, one that we call the {CBMSC(p, σ)} family. We analyze the belief propagation (BP) decoder over this channel by characterizing the decodable region of an ensemble of LDPC codes. We then give inner and outer bounds for this decodable region based on existing universal bounds on the performance of a BP decoder. We numerically evaluate the decodable region using density evolution. We also propose other message-passing schemes of interest and give their decodable regions. The performance of each proposed decoder over the CBMS channel family is evaluated through simulations. Finally, we explore capacity-approaching LDPC code ensembles for the {CBMSC(p, σ)} family.