Results 11 to 20 of about 196,265 (325)
Design of Low-Density Parity-Check Code Pair for Joint Source-Channel Coding Systems Based on Graph Theory. [PDF]
Entropy (Basel), 2023 In this article, a graph-theoretic method (taking advantage of constraints among sets associated with the corresponding parity-check matrices) is applied for the construction of a double low-density parity-check (D-LDPC) code (also known as LDPC code ...
Lv Y, He J, Xu W, Wang L.
europepmc +2 more sources
Quantum Low-Density Parity-Check Codes [PDF]
PRX Quantum, 2021 17 pages, 11 ...
Nikolas P. Breuckmann +1 more
openaire +8 more sources
EXIT Charts for Low-Density Algebra-Check Codes. [PDF]
Entropy (Basel)This paper focuses on the Low-Density Algebra-Check (LDAC) code, a novel low-rate channel code derived from the Low-Density Parity-Check (LDPC) code with expanded algebra-check constraints.
Tang Z, Lei J, Huang Y.
europepmc +2 more sources
Array Convolutional Low-Density Parity-Check Codes [PDF]
IEEE Communications Letters, 2013 This paper presents a design technique for obtaining regular time-invariant low-density parity-check convolutional (RTI-LDPCC) codes with low complexity and good performance. We start from previous approaches which unwrap a low-density parity-check (LDPC)
Baldi, Marco +2 more
core +3 more sources
Quasicyclic low-density parity-check codes from circulant permutation matrices [PDF]
IEEE Transactions on Information Theory, 2004 In this correspondence, the construction of low-density parity-check (LDPC) codes from circulant permutation matrices is investigated. It is shown that such codes cannot have a Tanner graph representation with girth larger than 12, and a relatively mild ...
M. Fossorier
semanticscholar +2 more sources
Improved low-density parity-check codes using irregular graphs and belief propagation [PDF]
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252), 1998 We construct new families of low-density parity-check codes, which we call irregular codes. When decoded using belief propagation, our codes can correct more errors than previously known low-density codes.
M. Luby +3 more
semanticscholar +2 more sources
Efficient encoding of low-density parity-check codes
IEEE Transactions on Information Theory, 2001 Low-density parity-check (LDPC) codes can be considered serious competitors to turbo codes in terms of performance and complexity and they are based on a similar philosophy: constrained random code ensembles and iterative decoding algorithms. We consider the encoding problem for LDPC codes.
Richardson, T., Urbanke, R.
openaire +3 more sources
Statistical mechanics of low-density parity-check codes [PDF]
Journal of Physics A: Mathematical and General, 2004 We review recent theoretical progress on the statistical mechanics of error correcting codes, focusing on low-density parity-check (LDPC) codes in general, and on Gallager and MacKay-Neal codes in particular. By exploiting the relation between LDPC codes and Ising spin systems with multispin interactions, one can carry out a statistical mechanics based
Y. Kabashima, D. Saad
openaire +3 more sources
Thresholds of Absorbing Sets in Low-Density Parity-Check Codes [PDF]
IEEE Transactions on Communications, 2017 In this paper, we investigate absorbing sets, responsible of error floors in Low Density Parity Check codes. We look for a concise, quantitative way to rate the absorbing sets' dangerousness. Based on a simplified model for iterative decoding evolution, we show that absorbing sets exhibit a threshold behavior. An absorbing set with at least one channel
Tomasoni A, Bellini S, Ferrari M
+9 more sources
Performance Evaluation Of Low Density Parity Check Codes [PDF]
, 2007 This paper mainly about the study on one of the widely used error correcting codes that is Low parity check Codes (LDPC). In this paper, the Regular LDPC code has been discussed The LDPC codes explained in this paper is about the Regular Binary LDPC codes or the Gallager.
Othman O. Khalifa +3 more
openaire +3 more sources