A CLASS OF LDPC CODE'S CONSTRUCTION BASED ON AN ITERATIVE RANDOM METHOD

This letter gives a random construction for Low Density Parity Check (LDPC) codes, which uses an iterative algorithm to avoid short cycles in the Tanner graph. The construction method has great flexible choice in LDPC code's parameters including codelength, code rate, the least girth of the graph, the weight of column and row in the parity check matrix. The method can be applied to the irregular LDPC codes and strict regular LDPC codes. Systemic codes have many applications in digital communication, so this letter proposes a construction of the generator matrix of systemic LDPC codes from the parity check matrix. Simulations show that the method performs well with iterative decoding.

Ensemble of High Performance Structured Binary Convolutional LDPC Codes with Moderate Rates

An algebraic construction methodology is proposed to design binary time-invariant convolutional low-density parity-check(LDPC)codes.Assisted by a proposed partial search algorithm,the polynomialform parity-check matrix of the time-invariant convolutional LDPC code is derived by combining some special codewords of an(n,2,n−1)code.The achieved convolutional LDPC codes possess the characteristics of comparatively large girth and given syndrome former memory.The objective of our design is to enable the time-invariant convolutional LDPC codes the advantages of excellent error performance and fast encoding.In particular,the error performance of the proposed convolutional LDPC code with small constraint length is superior to most existing convolutional LDPC codes.

Some extremal results on hypergraph Turán problems

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.