Results 11 to 20 of about 1,780 (149)
Low-Density Parity-Check Codes
IEICE ESS Fundamentals Review, 2021 Low Density Parity Check codes, LDPCs for short, are a family of codes which have shown near optimal error-correcting capabilites. They were proposed in 1963 by Robert Gallager in his PhD thesis. While he proved that probabilistic constructions of random LDPCs gave asymptotically good linear codes, they were largely abandoned due to the lack of ...
openaire +4 more sources
Quantum dialogue protocol based on self-dual quantum low density parity check codes
网络与信息安全学报, 2020 In quantum channels, particles are usually affected by noise during transmission. A quantum dialogue protocol based on self-dual quantum low density parity check codes was proposed to resist noise attacks.
LIU Fen, XU Pengao +1 more
doaj +3 more sources
A New Method for Building Low-Density-Parity-Check Codes
International Journal of Technology, 2019 This paper proposes a new method for building low-density-parity-check codes, exempt of cycle of length 4, based on a circulant permutation matrix, which needs very little memory for storage it in the encoder and a dual diagonal structure is applied ...
Tehami Mohammed Amine, Djebbari Ali
doaj +1 more source
Spatially Coupled Generalized Low-Density Parity-Check Codes Over Class-A Impulsive Noise Channels
IEEE Access, 2019 In this paper, a class of spatially coupled generalized low-density parity-check (SC-GLDPC) codes with minimum coupling width is introduced to mitigate the Class-A impulsive noise. Codes with minimum coupling width are beneficial to simple code structure,
Ping Wang, Liuguo Yin, Jianhua Lu
doaj +1 more source
ON THE CLASS OF ARRAY-BASED APM-LDPC CODES [PDF]
Journal of Algebraic Systems, 2021 We construct an explicit class of affine permutation matrix low-density parity-check (APM-LDPC) codes based on the array parity-check matrix by using two affine maps f (x) = x-1 and g(x) = 2x-1 on Z_m, where m is an odd prime number, with girth 6 and ...
A. Nassaj, A. R. Naghipour
doaj +1 more source
On the Stopping Distance of SA-LDPC Codes by Transversal Designs
IEEE Access, 2018 In this paper, we analyze the size of the smallest stopping set (called the stopping distance) for the parity-check matrix of a superposed array low-density parity-check (SA-LDPC) code for column weights 3 and 4 by using the transversal design (TD ...
Zahra Ferdosi +2 more
doaj +1 more source
Multilevel generalised low-density parity-check codes [PDF]
Electronics Letters, 2006 Multilevel coding invoking generalised low-density parity-check component codes is proposed, which is capable of outperforming the classic low-density parity check component codes at a reduced decoding latency.
Tee, R.Y.S., Kuo, F.C., Hanzo, L.
openaire +2 more sources
Fifteen Years of Quantum LDPC Coding and Improved Decoding Strategies
IEEE Access, 2015 The near-capacity performance of classical low-density parity check (LDPC) codes and their efficient iterative decoding makes quantum LDPC (QLPDC) codes a promising candidate for quantum error correction.
Zunaira Babar +4 more
doaj +1 more source
Multilevel Structured Low-Density Parity-Check Codes [PDF]
2008 IEEE International Conference on Communications, 2008 Low-density parity-check (LDPC) codes are typically characterized by a relatively high-complexity description, since a considerable amount of memory is required in order to store their code description, which can be represented either by the connections of the edges in their Tanner graph or by the non-zero entries in their parity-check matrix (PCM ...
Bonello, Nicholas +2 more
openaire +2 more sources
Entropy, 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 ...
Yijie Lv +3 more
doaj +1 more source