2009 · 97 citations · 16 references
EngineeringPhysicsComputational GeometryDirected EvolutionStructural BioinformaticsChannel CapacityChannel CodingCoding TheoryError Control CodingError-correcting CodesBlock CodesCode BoundsConvolutional CodesLdpc CodesParity Check CodesThreshold ImprovementThreshold Quantities
We present a family of protograph based LDPC codes that can be derived from permutation matrix based regular (J,K) LDPC convolutional codes by termination. In the terminated protograph, all variable nodes still have degree J but some check nodes at the start and end of the protograph have degrees smaller than K. Since the fraction of these stronger nodes vanishes as the termination length L increases, we call the codes asymptotically regular. The density evolution thresholds of these protographs are better than those of regular (J, K) block codes. Interestingly, this threshold improvement gets stronger with increasing node degrees (at a fixed rate) and it does not decay as L increases. Terminated convolutional protographs can also be derived from standard irregular protographs and may exhibit a significant threshold improvement.
16
Low-density parity-check codes
Robert G. Gallager · IEEE Transactions on Information Theory · 1962 · 10.6K citations · Full text
Efficient erasure correcting codes
Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi et al. · IEEE Transactions on Information Theory · 2001 · 1.2K citations · Full text
Practical loss-resilient codes
Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi et al. · 1997 · 747 citations · Full text