Results 11 to 20 of about 1,915 (216)
Low Density Parity Check Codes Constructed from Hankel Matrices
In this paper, a new technique for constructing low density parity check codes based on the Hankel matrix and circulant permutation matrices is proposed. The new codes are exempt of any cycle of length 4.
Mohammed Amine Tehami
doaj +1 more source
This paper studies the blind recognition method of the sparse parity‐check matrices of low‐density parity‐check codes in noncooperative communication, which is critical to the reverse analysis of communication protocols using LDPC codes.
Yong Ding, Zhiping Huang, Jing Zhou
doaj +1 more source
Quantum dialogue protocol based on self-dual quantum low density parity check codes
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
Reversible Low-Density Parity-Check Codes
Low-density parity-check (LDPC) codes may be decoded using a circuit implementation of the sum-product algorithm which maps the factor graph of the code. By reusing the decoder for encoding, both tasks can be performed using the same circuit, thus reducing area and verification requirements.
David Haley, Alex J. Grant
openaire +2 more sources
A New Method for Building Low-Density-Parity-Check Codes
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
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
Fifteen Years of Quantum LDPC Coding and Improved Decoding Strategies
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
ON THE CLASS OF ARRAY-BASED APM-LDPC CODES [PDF]
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
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
An Efficient Construction Method for Quasi-Cyclic Low Density Parity Check Codes
In this paper, we propose an optimized belief propagation (OBP) based progressive edge-growth (PEG) method for constructing quasi-cyclic low density parity check (QC-LDPC) codes. In this proposed method, Tanner graphs are built by progressively appending
Yiming Lei, Mingke Dong
doaj +1 more source

