Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Modern Coding Theory
Good error-correcting codes based on very sparse matrices
IEEE Transactions on Information Theory
Which codes have cycle-free Tanner graphs?
IEEE Transactions on Information Theory
Improved low-density parity-check codes using irregular graphs
IEEE Transactions on Information Theory
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
Capacity-achieving sequences for the 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
Design and analysis of nonbinary LDPC codes for arbitrary discrete-memoryless channels
IEEE Transactions on Information Theory
Weight Distribution of Low-Density Parity-Check Codes
IEEE Transactions on Information Theory
Generalized Low-Density Parity-Check Codes Based on Hadamard Constraints
IEEE Transactions on Information Theory
| Hi-index | 754.84 |
In this paper, a new class oflow-density parity-check (LDPC) codes, named hybrid LDPC codes, is introduced. Hybrid LDPC codes are characterized by an irregular connectivity profile and heterogeneous orders of the symbols in the codeword. It is shown in particular that the class of hybrid LDPC codes can be asymptotically characterized and optimized using density evolution (DE) framework, and a technique to maximize the minimum distance of the code is presented. Numerical assessment of hybrid LDPC code performances is provided, by comparing them to protograph-based and multiedge-type (MET) LDPC codes. Hybrid LDPC codes are shown to allow to achieve an interesting tradeoff between good error-floor performance and good waterfall region with nonbinary coding techniques.