Multi-Edge Type LDPC Codes

By T. Richardson, Rüdiger L. Urbanke. 2004

326 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/27ed099a5e74d9eae71700a187d91fba648da2fd

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Long-distance continuous-variable quantum key distribution by controlling excess noise (2016, methodology): “Based on the multiedge-type low density parity check codes 34 and the technique of repetition scheme 35 , we developed a 25 MHz ECC 36 which exhibits an efficiency of β = 95.6% at the SNR threshold of 0.002 (detailed in Supplementary S2).”
Low-Density Parity-Check (LDPC) Codes Constructed from Protographs (2003, methodology): “However, a useful refinement [1] is to allow the variable node set V to contain untransmitted variables.”
Capacity-approaching protograph codes (2009, background): “A large volume of work has been conducted on the design of LDPC codes with imposed substructures, starting with the introduction of multi-edge-type codes in [10] and [11].”
Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform So Well over the BEC (2010, methodology): “The difficulty consists in showing that all these individual FPs form a smooth one-dimensional manifold so that one can use the Area Theorem and integrate with respect to this curve.”
Towards Massive, Ultra-Reliable, and Low-Latency Wireless Communication with Short Packets (2015, background): “For larger packet size, list decoding of polar codes combined with CRC [54] and multi-edge (ME) type LDPC codes [55] are a competitive benchmark.”
Protograph LDPC Codes Design Based on EXIT Analysis (2007, methodology): “The analysis of many code classes demonstrates the accuracy of the approach, which provides precise threshold estimates compared to the ones obtained through the more computationally-expensive approach of [4].”