Results 21 to 30 of about 45,321 (190)
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
Quantum message-passing algorithm for optimal and efficient decoding [PDF]
Quantum, 2022 Recently, Renes proposed a quantum algorithm called belief propagation with quantum messages (BPQM) for decoding classical data encoded using a binary linear code with tree Tanner graph that is transmitted over a pure-state CQ channel \cite{renes_2017 ...
Christophe Piveteau, Joseph M. Renes
doaj +1 more source
A REDUCTION IN THE SEARCH SPACE OF QC-LDPC CODES WITH GIRTH 8 [PDF]
Journal of Algebraic Systems, 2020 In this paper, we define a structure to obtain exponent matrices of girth-8 QC-LDPC codes with column weight 3. Using the difference matrices introduced by Amirzade et al., we investigate necessary and sufficient conditions which result in a Tanner graph
F. Amirzade +2 more
doaj +1 more source
Efficient Decoding of Turbo Codes with Nonbinary Belief Propagation
EURASIP Journal on Wireless Communications and Networking, 2008 This paper presents a new approach to decode turbo codes using a nonbinary belief propagation decoder. The proposed approach can be decomposed into two main steps.
Thierry Lestable +2 more
doaj +2 more sources
A Note on the Girth of (3, 19)-Regular Tanner’s Quasi-Cyclic LDPC Codes
IEEE Access, 2021 In this article, we study the cycle structure of (3, 19)-regular Tanner’s quasi-cyclic (QC) LDPC codes with code length $19p$ , where $p$ is a prime and $p\equiv 1~(\bmod ~57)$ , and transform the conditions for the existence of cycles of ...
Manjie Zhou +4 more
doaj +1 more source
Effective identification of dominant fully absorbing sets for Raptor-like LDPC codes
ETRI Journal, 2023 The error-rate floor of low-density parity-check (LDPC) codes is attributed to the trapping sets of their Tanner graphs. Among them, fully absorbing sets dominantly affect the error-rate performance, especially for short blocklengths.
Woncheol Cho +3 more
doaj +1 more source
Quantum LDPC Codes Based on Cocyclic Block Matrices
Entropy, 2023 Motivated by a family of binary cocyclic block matrices over GF(2), we proposed a construction method to gain the stabilizer of long-length quantum error-correction codes (QECCs).
Yuan Li, Ying Guo
doaj +1 more source
An improved method for counting 6-cycles in low-density parity-check codes [PDF]
Serbian Journal of Electrical Engineering, 2023 Since their rediscovery in the early 1990s, low-density parity-check (LDPC) codes have become the most popular error-correcting codes owing to their excellent performance. An LDPC code is a linear block code that has a sparse parity-check matrix.
Slimani Djamel, Kaddai Abdellah
doaj +1 more source
IEEE Access, 2021 Multitype quasi-cyclic (QC) low-density parity-check (LDPC) codes are a class of protograph LDPC codes lifted cyclically from protographs with multiple edges, represented by two weight and slope matrices.
Farzaneh Abedi, Mohammad Gholami
doaj +1 more source
Low-Floor Tanner Codes via Hamming-Node or RSCC-Node Doping [PDF]
, 2006 We study the design of structured Tanner codes with low error-rate floors on the AWGN channel. The design technique involves the “doping” of standard LDPC (proto-)graphs, by which we mean Hamming or recursive systematic convolutional (RSC) code ...
Abu-Surra, Shadi +2 more
core +1 more source