Low-Density Parity-Check Codes

By Christian Schlegel, Lance C. Perez. 2004

11,303 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/17d0afe4f814e5abc6252e572e3b039082bf6f07

How researchers see this paper

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

In Computer Networks and Communications

In Electrical and Electronic Engineering

Citations in the corpus

Asymmetric quantum error-correcting codes (2006, background): “Phys 43 (2002) 4452 [7] R.G. Gallager “Low-Density Parity-Check Codes”, MIT Press, Cambridge, MA (1963) [8] D.J.C. MacKay “Information theory, Inference and Learning Algorithms”, Cambridge Univ. Press 2003 [9] T. Richardson and R. Urbanke, “Modern Coding Theory”, in preparation at http://lthcwww.epf”
On compressing encrypted data (2004, methodology): “Knowledge of the correlation between the encrypted string and the key (which is equivalent to knowledge of the source statistics) and the syndrome (bin-index or coset-index) of the encoded data is exploited by a belief propagation algorithm [22], [23] to recover exactly the encrypted sequence.”
Enabling Privacy Preserving GWAS in Heterogeneous Human Populations (2016, methodology): “Although LSH functions are usually constructed in a uniformly random way, we propose a new and efficient design of LSH functions based on the idea of the low-density parity-check (LDPC) code invented by Robert G Gallager for noisy message transmission [6, 7].”
LDPC block and convolutional codes based on circulant matrices (2004, background): “An upper bound on the girth of a graph is obtained from the well-known tree bound [10].”
Protograph LDPC Codes Design Based on EXIT Analysis (2007, methodology): “EXIT charts have been used in [2] to design low-density parity-check (LDPC) codes [3] for modulation and detection.”
Advanced Lectures on Machine Learning (2004, methodology): “There are several minor modifications to SFFS and SBFS, such as Sequential Floating Search [41] or the ”Plus n, take away m” features.”
Fault-tolerant quantum computation with constant overhead (2013, background): “Then there is a suitable choice of constants (r, c) such that a random [n, k, d] classical (r, c)-LDPC code, for at least a constant fraction of (large) n, has, with high probability, asymptotic rate k/n→ Rc and a constant relative distance d/n [12].”
Nonorthogonal Multiple Access for 5G and Beyond (2017, background): “2) LDS-CDMA: LDS based CDMA constitutes an enhanced version of CDMA [233], which is inspired by the investigations on the low-density parity check (LDPC) codes [234].”
Design of Low-Density Parity Check Codes for 5G New Radio (2018, neutral): “thesis [8].”
THE NON-BACKTRACKING SPECTRUM OF THE UNIVERSAL COVER OF A GRAPH (2007, methodology): “…walks seem to be an essential part of various aspects of graph theory, including the Broder-Shamir trace method ([9,11, 12,14]), Ihara zeta functions of graphs ([19,26,32]), Bollobas’ question concerning girth and average degree ([2,21]), and decoding of low density linear codes ([17,29, 31]).”
Phase change memory technology (2010, methodology): “Examples of such relevant coding techniques include enhancing traditional algebraic coding techniques with soft decoding capabilities, as well as using powerful coding mechanisms such as Low Density Parity Check (LDPC) codes with iterative decoding methods[242].”
Novel Low-Density Signature for Synchronous CDMA Systems Over AWGN Channel (2008, background): “The question is that, if we are to allow some interference to exist then what is the best possible to manage it such that it can play into our advantage.”
Survey propagation: An algorithm for satisfiability (2002, neutral): “BP is a generic algorithm for computing marginal probability distributions in problems defined on factor graphs, which has been very useful in the context of error correcting codes [13] and Bayesian networks [32].”