Multi-type quasi-cyclic(QC) low-density parity-check(LDPC) codes can be considered as multiple-edge protograph QC-LDPC codes having some advantages in the minimum Hamming distance bound over single-edge protograph cod...Multi-type quasi-cyclic(QC) low-density parity-check(LDPC) codes can be considered as multiple-edge protograph QC-LDPC codes having some advantages in the minimum Hamming distance bound over single-edge protograph codes or type-Ⅰ QC-LDPC codes when the base matrices have the same size. In this paper, we investigate a class of multi-type QC-LDPC codes whose parity-check matrices contain just one blockrow of circulants and we obtain the generator matrix of such codes in general form. Using the permutation arrays and defining injection arrays, we present a new approach to construct a class of high-rate type-Ⅰ QC-LDPC codes with girth 6 from the constructed 4-cycle free multi-type QC-LDPC codes. In continue, for 2 ≤ w≤6, some type-w QC-LDPC codes with girth 6 are constructed explicitly such that the constructed codes are flexible in terms of rate and length. To the best of our knowledge, for w = 5,6, this is the first paper which deals with the explicit construction of type-w QC-LDPC codes with girth 6 and high rates. Moreover, for w = 3, 4, the constructed type-w QC-LDPC codes have better(6,8)-cycle multiplicities than the codes with minimum achievable length recently constructed by cyclic difference families(CDFs). Simulation results show that the binary and non-binary constructed codes outperform the constituent underlying QC-LDPC codes.展开更多
An explicR N-fold Darboux transformation with multi-parameters for coupled mKdV equation is constructed with the help of a gauge transformation of the Ablowitz-Kaup-Newell-Segur （AKNS） system spectral problem. By us...An explicR N-fold Darboux transformation with multi-parameters for coupled mKdV equation is constructed with the help of a gauge transformation of the Ablowitz-Kaup-Newell-Segur （AKNS） system spectral problem. By using the Darboux transformation and the reduction technique, some multi-soliton solutions for the complex mKdV equation are obtained.展开更多
In this paper, the possible value of the differential uniformity of a function over finite fields is discussed. It is proved that, the differential uniformity of a function over Fq can be any even integer between 2 an...In this paper, the possible value of the differential uniformity of a function over finite fields is discussed. It is proved that, the differential uniformity of a function over Fq can be any even integer between 2 and q when q is even; and it can be any integer between 1 and q except q-1 when q is odd. Moreover, for any possible differential uniformity t, an explicit construction of a differentially t-uniform function is given.展开更多
For two r-graphs T and H,let ex_(r)(n,T,H)be the maximum number of copies of T in an n-vertex H r-graph.The determination of the Turán number ex_(r)(n,T,H)has become the fundamental core problem in extremal graph...For two r-graphs T and H,let ex_(r)(n,T,H)be the maximum number of copies of T in an n-vertex H r-graph.The determination of the Turán number ex_(r)(n,T,H)has become the fundamental core problem in extremal graph theory ever since the pioneering work of Turán’s theorem was published in 1941.Although we have some rich results for the simple graph case,only sporadic results have been known for the hypergraph Turán problems.In this paper,we mainly focus on the function ex_(r)(n,T,H)when H is one of two different hypergraph extensions of the complete bipartite graph K_(s,t).The first extension is the complete bipartite r-graph K^((r))_(s,t),which was introduced by Mubayi and Verstraëte(2004).Using the powerful random algebraic method,we show that if s is sufficiently larger than t,then ex_(r)(n,T,K^((r))_(s,t))=Ω(n^(v−e/t)),where T is an r-graph with v vertices and e edges.In particular,when T is an edge or some specified complete bipartite r-graph,we can determine their asymptotics.The second important extension is the complete r-partite r-graph K^((r))_(s1,s2,…,sr,)which has been widely studied.When r=3,we provide an explicit construction giving ex_(3)(n,K^((3))_(2,2,7))≥1/27n19/7+o(n19/7).Our construction is based on the norm graph,and improves the lower boundΩ(n73/27)obtained by the probabilistic method.展开更多
文摘Multi-type quasi-cyclic(QC) low-density parity-check(LDPC) codes can be considered as multiple-edge protograph QC-LDPC codes having some advantages in the minimum Hamming distance bound over single-edge protograph codes or type-Ⅰ QC-LDPC codes when the base matrices have the same size. In this paper, we investigate a class of multi-type QC-LDPC codes whose parity-check matrices contain just one blockrow of circulants and we obtain the generator matrix of such codes in general form. Using the permutation arrays and defining injection arrays, we present a new approach to construct a class of high-rate type-Ⅰ QC-LDPC codes with girth 6 from the constructed 4-cycle free multi-type QC-LDPC codes. In continue, for 2 ≤ w≤6, some type-w QC-LDPC codes with girth 6 are constructed explicitly such that the constructed codes are flexible in terms of rate and length. To the best of our knowledge, for w = 5,6, this is the first paper which deals with the explicit construction of type-w QC-LDPC codes with girth 6 and high rates. Moreover, for w = 3, 4, the constructed type-w QC-LDPC codes have better(6,8)-cycle multiplicities than the codes with minimum achievable length recently constructed by cyclic difference families(CDFs). Simulation results show that the binary and non-binary constructed codes outperform the constituent underlying QC-LDPC codes.
文摘An explicR N-fold Darboux transformation with multi-parameters for coupled mKdV equation is constructed with the help of a gauge transformation of the Ablowitz-Kaup-Newell-Segur （AKNS） system spectral problem. By using the Darboux transformation and the reduction technique, some multi-soliton solutions for the complex mKdV equation are obtained.
基金supported by National Natural Science Foundation of China(Grant Nos.61070215 and 61272484)the National Basic Research Program of China(Grant No.2013CB338002)the open research fund of Science and Technology on Information Assurance Laboratory(Grant No.KJ-12-02)
文摘In this paper, the possible value of the differential uniformity of a function over finite fields is discussed. It is proved that, the differential uniformity of a function over Fq can be any even integer between 2 and q when q is even; and it can be any integer between 1 and q except q-1 when q is odd. Moreover, for any possible differential uniformity t, an explicit construction of a differentially t-uniform function is given.
基金supported by the National Key Research and Development Program of China(Grant No.2020YFA0712100)National Natural Science Foundation of China(Grant No.11971325)+1 种基金supported by National Natural Science Foundation of China(Grant No.11801109)Beijing Scholars Program。
文摘For two r-graphs T and H,let ex_(r)(n,T,H)be the maximum number of copies of T in an n-vertex H r-graph.The determination of the Turán number ex_(r)(n,T,H)has become the fundamental core problem in extremal graph theory ever since the pioneering work of Turán’s theorem was published in 1941.Although we have some rich results for the simple graph case,only sporadic results have been known for the hypergraph Turán problems.In this paper,we mainly focus on the function ex_(r)(n,T,H)when H is one of two different hypergraph extensions of the complete bipartite graph K_(s,t).The first extension is the complete bipartite r-graph K^((r))_(s,t),which was introduced by Mubayi and Verstraëte(2004).Using the powerful random algebraic method,we show that if s is sufficiently larger than t,then ex_(r)(n,T,K^((r))_(s,t))=Ω(n^(v−e/t)),where T is an r-graph with v vertices and e edges.In particular,when T is an edge or some specified complete bipartite r-graph,we can determine their asymptotics.The second important extension is the complete r-partite r-graph K^((r))_(s1,s2,…,sr,)which has been widely studied.When r=3,we provide an explicit construction giving ex_(3)(n,K^((3))_(2,2,7))≥1/27n19/7+o(n19/7).Our construction is based on the norm graph,and improves the lower boundΩ(n73/27)obtained by the probabilistic method.
