Results 21 to 30 of about 651,900 (282)
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
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
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
openaire +3 more sources
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
Necessary and Sufficient Girth Conditions for LDPC Tanner Graphs with Denser Protographs [PDF]
2021 11th International Symposium on Topics in Coding (ISTC), 2021 This paper gives necessary and sufficient conditions for the Tanner graph of a quasi-cyclic (QC) low-density parity-check (LDPC) code based on the all-one protograph to have girth 6, 8, 10, and 12, respectively, in the case of parity-check matrices with column weight 4.
Anthony Gómez-Fonseca +2 more
openaire +2 more sources
Study of equivalent point-to-point transmission model for coded relay cooperations
Tongxin xuebao, 2012 LDPC-coded relay cooperation and its joint iterative decoding based on the bi-layer Tanner graph were investigated.The coded relay cooperation becomed an equivalent and relatively simple point-to-point transmission model by introducing the notation of ...
Qiu-xia ZHANG +3 more
doaj +2 more sources
Pseudo-Codeword Analysis of Tanner Graphs From Projective and Euclidean Planes [PDF]
IEEE Transactions on Information Theory, 2007 Submitted to IEEE Transactions on Information Theory, February 25 ...
Roxana Smarandache, Pascal O. Vontobel
openaire +2 more sources
Efficient algorithm for calculating short cycles in Tanner graph based on matrix computation
Tongxin xuebao, 2017 Loop distribution of Tanner graph affects the BER performance of low-density parity-check codes(LDPC) decoding.To count short cycles in the Tanner graph efficiently,a side by side recursion algorithm based on matrix computation was proposed.Firstly,5 ...
Qing ZHU +4 more
doaj +2 more sources
On the girth of Tanner (3,7) quasi-cyclic LDPC codes [PDF]
Transactions on Combinatorics, 2012 S. Kim, et al, have been analyzed the girth of some algebraically structured quasi-cyclic (QC) low-density parity-check (LDPC) codes, i.e. Tanner (3,5) of length 5p, where p is a prime of the form 15m+1. In this paper, by extension this method to Tanner (
Mohammad Gholami +1 more
doaj
On the Construction of Sparse Matrices From Expander Graphs
Frontiers in Applied Mathematics and Statistics, 2018 We revisit the asymptotic analysis of probabilistic construction of adjacency matrices of expander graphs proposed in Bah and Tanner [1]. With better bounds we derived a new reduced sample complexity for d, the number of non-zeros per column of these ...
Bubacarr Bah, Bubacarr Bah, Jared Tanner
doaj +1 more source