Results 11 to 20 of about 3,564 (250)
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
Pseudocodewords of Tanner Graphs
IEEE Transactions on Information Theory, 2007 This papers presents a detailed analysis of pseudocodewords of Tanner graphs. Pseudocodewords arising on the iterative decoder's computation tree are distinguished from pseudocodewords arising on finite degree lifts. Lower bounds on the minimum pseudocodeword weight are presented for the BEC, BSC, and AWGN channel.
Christine A. Kelley, Deepak Sridhara
openaire +2 more sources
Advances in Mathematics of Communications, 2012 Codes defined on graphs and their properties have been subjects of intense recent research. In this work, we are concerned with codes that have planar Tanner graphs. When the Tanner graph is planar, message-passing decoders can be efficiently implemented on chips without any issues of wiring.
Srimathy Srinivasan, Andrew Thangaraj
openaire +1 more source
Improved Construction of Irregular Progressive Edge-Growth Tanner Graphs [PDF]
IEEE Communications Letters, 2010 The progressive edge-growth algorithm is a well-known procedure to construct regular and irregular low-density parity-check codes. In this paper, we propose a modification of the original algorithm that improves the performance of these codes in the waterfall region when constructing codes complying with both, check and symbol node degree distributions.
Martínez Mateo, Jesús +2 more
openaire +3 more sources
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
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
Algorithms for Enumerating Balanced Tanner Graphs
CoRR, 2011 This summarizes our latest understanding and results about the algorithms for enumerating Tanner Graphs that have a regular structure called Balanced Tanner Graphs. Enumeration algorithms for Balanced Tanner Graphs based upon Cyclic Permutation Groups have been developed in this paper. A constrained enumeration algorithm that enumerates Balanced Tanner
Nittoor, Vivek S, Suda, Reiji
openaire +3 more sources
High-Throughput Multi-Frame Decoding of QC-LDPC Codes With Modified Rejection-Based Minimum Finding
IEEE Access, 2022 The key computation in the min-sum decoding algorithm of a Low-Density Parity-Check (LDPC) is finding the first two minima and also the location of the first minimum among a set of messages passed from Variable Nodes (VNs) to Check Nodes (CNs) in a ...
Alireza Hasani +3 more
doaj +1 more source
QuantumQuantum information is fragile and must be protected by a quantum error-correcting code for large-scale practical applications. Recently, highly efficient quantum codes have been discovered which require a high degree of spatial connectivity. This raises
Nouédyn Baspin, Dominic Williamson
doaj +1 more source