Results 21 to 30 of about 3,564 (250)
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
Pseudocodeword-free criterion for codes with cycle-free Tanner graph [PDF]
Designs, Codes and Cryptography, 2018 Iterative decoding and linear programming decoding are guaranteed to converge to the maximum-likelihood codeword when the underlying Tanner graph is cycle-free. Therefore, cycles are usually seen as the culprit of low-density parity-check (LDPC) codes. In this paper, we argue in the context of graph cover pseudocodeword that, for a code that permits a ...
openaire +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
openaire +1 more source
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
A Mathematical Approach to Balanced Tanner Graph Enumeration
CoRR, 2011 This paper summarizes our latest understanding and results about the application of the Mathematics Of Enumeration to Tanner Graphs that have a regular structure called Balanced Tanner Graphs. Some preliminaries of permutation groups have been presented followed by various enumeration theorems, and finally our approach for enumeration of Balanced ...
Nittoor, Vivek S, Suda, Reiji
openaire +3 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
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 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
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective To evaluate the efficacy and safety of ofatumumab in patients with myelin oligodendrocyte glycoprotein antibody–associated disease (MOGAD), and compare it with rituximab. Methods We conducted a single–center, observational study including 22 MOGAD patients treated with ofatumumab and 21 treated with rituximab.
Yuxin Fan +5 more
wiley +1 more source