Error-correction capability of column-weight-three LDPC codes
IEEE Transactions on Information Theory
Error correction capability of column-weight-three LDPC codes under the Gallager A algorithm-Part II
IEEE Transactions on Information Theory
The capacity of low-density parity-check codes under message-passing decoding
IEEE Transactions on Information Theory
Expander graph arguments for message-passing algorithms
IEEE Transactions on Information Theory
Finite-length analysis of low-density parity-check codes on the binary erasure channel
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Regular and irregular progressive edge-growth tanner graphs
IEEE Transactions on Information Theory
Eliminating Trapping Sets in Low-Density Parity-Check Codes by Using Tanner Graph Covers
IEEE Transactions on Information Theory
An area efficient LDPC decoder using a reduced complexity min-sum algorithm
Integration, the VLSI Journal
Hi-index | 0.00 |
A class of two-bit message passing decoders for decoding column-weight-four LDPC codes over the binary symmetric channel is proposed. The thresholds for various decoders in this class are derived using density evolution. For a specific decoder, the sufficient conditions for correcting all error patterns with up to three errors are derived.