Low-density parity-check codes - Open Access .click

2009
AbstractLow-density parity-check (LDPC) codes are among the most efficient error correcting codes in use. This chapter introduces an important family of LDPC ensembles, based on random factor graphs, and studies some of their basic properties. It focuses on performances under optimal decoding, when no constraint is imposed on the computational ...
Marc Mézard, Andrea Montanari
+6 more sources

Structured Low-Density Parity-Check Codes

IEEE Signal Processing Magazine, 2004
This article describes the different methods to design regular low density parity-check (LDPC) codes with large girth. In graph terms, this corresponds to designing bipartite undirected regular graphs with large girth. Large girth speeds the convergence of iterative decoding and improves the performance at least in the high SNR range, by slowing down ...
Alexander Kuznetsov +3 more
+4 more sources

GRAPHICAL QUANTUM LOW-DENSITY PARITY-CHECK CODES

International Journal of Modern Physics B, 2012
Graphical approach provides a direct way to construct error correction codes. Motivated by its good properties, associating low-density parity-check (LDPC) codes, in this paper we present families of graphical quantum LDPC codes which contain no girth of four.
Li, Yuan, Xu, Mantao, Meng, Yinkuo, Guo, Ying +3 more
openaire +2 more sources

Low Density Parity Check Codes

2020
A linear code with a check matrix in which each column has few non-zero entries is called a low density parity check code or, for brevity, an LDPC code. These codes were introduced in the 1960s by Gallager who proved that probabilistic constructions of such matrices produce asymptotically good linear codes. Moreover, he observed that LDPC codes perform
openaire +1 more source

physics
ldpc codes
iterative decoding

low density parity check codes
004
620

tanner graph
ldpc
error correcting codes