Results 11 to 20 of about 45,321 (190)
Pseudo-Codeword Analysis of Tanner Graphs from Projective and Euclidean Planes [PDF]
IEEE Transactions on Information Theory, 2006 Submitted to IEEE Transactions on Information Theory, February 25 ...
Roxana Smarandache, Pascal O. Vontobel
openalex +4 more sources
On the Complexity of finding Stopping Distance in Tanner Graphs [PDF]
CoRR, 2005 Two decision problems related to the computation of stopping sets in Tanner graphs are shown to be NP-complete.
K. Murali Krishnan, Priti Shankar
openalex +3 more sources
LDPC Codes on Balanced Incomplete Block Designs: Construction, Girth, and Cycle Structure Analysis [PDF]
EntropyIn this paper, we investigate the cycle structure inherent in the Tanner graphs of low-density parity-check (LDPC) codes constructed from balanced incomplete block designs (BIBDs).
Hengzhou Xu +4 more
doaj +2 more sources
Determining the Upper-Bound on the Code Distance of Quantum Stabilizer Codes Through the Monte Carlo Method Based on Fully Decoupled Belief Propagation [PDF]
EntropyThe code distance is a critical parameter of quantum stabilizer codes (QSCs), and determining it—whether exactly or approximately—is known to be an NP-complete problem.
Zhipeng Liang +4 more
doaj +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
openalex +2 more sources
Which Codes Have 4-Cycle-Free Tanner Graphs? [PDF]
IEEE Transactions on Information Theory, 2006 Let C be an [n,k,d] binary linear code with rate R=k/n and dual C perp. In this correspondence, it is shown that C can be represented by a 4-cycle-free Tanner graph only if: pdperples lfloorradicnp(p-1)+n2/4+n/2 rfloorwhere p=n-k and dperp is the minimum distance of C perp.
Thomas R. Halford +2 more
+5 more sources
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
openalex +3 more sources
Calculation of Girth of Tanner Graph in LDPC Codes [PDF]
Trends in Applied Sciences Research, 2012 Mahdi Ahmadi +3 more
openalex +2 more sources
Adaptive Learned Belief Propagation for Decoding Error-Correcting Codes [PDF]
EntropyWeighted belief propagation (WBP) for the decoding of linear block codes is considered. In WBP, the Tanner graph of the code is unrolled with respect to the iterations of the belief propagation decoder.
Alireza Tasdighi, Mansoor Yousefi
doaj +2 more sources
Eliminating trapping sets in low-density parity-check codes by using Tanner graph covers [PDF]
IEEE Transactions on Information Theory, 2008 Miloš Ivković +2 more
exaly +2 more sources