Results 51 to 60 of about 2,700 (119)
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
Type-II QC-LDPC Codes From Multiplicative Subgroup of Prime Field
IEEE Access, 2020 A quasi-cyclic (QC) low-density parity-check (LDPC) code is called type-II, if the maximum weight over all circulants appearing in the parity-check matrix has the value of two. On the basis of multiplicative subgroup analysis for the prime field, a novel
Guohua Zhang +4 more
doaj +1 more source
A revival of the girth conjecture
Journal of Combinatorial Theory, Series B, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tomás Kaiser +2 more
openaire +2 more sources
Horse Ammunition. From the History of a Saddle
Вестник Волгоградского государственного университета. Серия 4. История, регионоведение, международные отношения, 2019 Introduction. Horse ammunition was formed historically on a large geographical area. The most important component of it is a saddle. The ancient history of a saddle is not sufficiently investigated.
Sergey I. Lukyashko
doaj +1 more source
The Moore Graph of Diameter 2 and Degree 57 via Cyclic Derangements
AxiomsThe possible existence of a regular Moore graph of diameter 2 and degree 57 with the maximum number 3250 of vertices has been an open question for over 65 years.
Derek H. Smith, Roberto Montemanni
doaj +1 more source
Superconnectivity of graphs with odd girth g and even girth h
Discrete Applied Mathematics, 2009 A maximally connected graph G of minimum degree δ is said to be superconnected (for short super-κ) if all disconnecting sets of cardinality δ are the neighborhood of some vertex of degree δ. Sufficient conditions on the diameter to guarantee that a graph of odd girth g and even girth h ≥ g + 3 is super-κ are stated. Also polarity graphs are shown to be
Montejano, Luis P. +2 more
openaire +4 more sources
L(2, 1)-Labelings of Some Families of Oriented Planar Graphs
Discussiones Mathematicae Graph Theory, 2014 In this paper we determine, or give lower and upper bounds on, the 2-dipath and oriented L(2, 1)-span of the family of planar graphs, planar graphs with girth 5, 11, 16, partial k-trees, outerplanar graphs and cacti.
Sen Sagnik
doaj +1 more source
Low Density Parity Check Codes Constructed from Hankel Matrices
Journal of Telecommunications and Information Technology, 2018 In this paper, a new technique for constructing low density parity check codes based on the Hankel matrix and circulant permutation matrices is proposed. The new codes are exempt of any cycle of length 4.
Mohammed Amine Tehami
doaj +1 more source
On the annihilator graphs of partial transformation semigroups
Arab Journal of Basic and Applied SciencesLet [Formula: see text] and [Formula: see text] be a partial transformation semigroup on [Formula: see text] Obviously, the empty set [Formula: see text] is a zero element of [Formula: see text] and denoted by 0.
Chollawat Pookpienlert +2 more
doaj +1 more source
Light Graphs In Planar Graphs Of Large Girth
Discussiones Mathematicae Graph Theory, 2016 A graph H is defined to be light in a graph family 𝒢 if there exist finite numbers φ(H, 𝒢) and w(H, 𝒢) such that each G ∈ 𝒢 which contains H as a subgraph, also contains its isomorphic copy K with ΔG(K) ≤ φ(H, 𝒢) and ∑x∈V(K) degG(x) ≤ w(H, 𝒢).
Hudák Peter +3 more
doaj +1 more source