Results 11 to 20 of about 3,456 (247)
SISO APP Searches in Lattices With Tanner Graphs [PDF]
IEEE Transactions on Information Theory, 2012 15 pages, 6 figures, 2 tables, uses IEEEtran ...
Dumitru Mihai Ionescu, Haidong Zhu
openaire +2 more sources
A Neural Network Empowered Belief Propagation Algorithm Optimized for Short-Cycles in Tanner Graph
IEEE Transactions on Machine Learning in Communications and Networking, 2023 Short-cycles in Tanner graphs have a direct impact on the accuracy and effectiveness of the belief propagation (BP) algorithm, as they diverge the BP algorithm by disrupting the independency of message transmission.
Hao Xu, Ying Li, Bin Tan, Jun Wu, Die Hu
doaj +1 more source
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
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