NEW CONSTRUCTIONS OF LDPC CODES BASED ON CIRCULANT PERMUTATION MATRICES FOR AWGN CHANNEL

Two new design approaches for constructing Low-Density Parity-Check(LDPC) codes are proposed.One is used to design regular Quasi-Cyclic LDPC(QC-LDPC) codes with girth at least 8.The other is used to design irregular LDPC codes.Both of their parity-check matrices are composed of Circulant Permutation Matrices(CPMs).When iteratively decoded with the Sum-Product Algorithm(SPA),these proposed codes exhibit good performances over the AWGN channel.

A Family of Asymmetrical Orthogonal Arrays with Run Sizes 4p^2

Nowadays orthogonal arrays play important roles in statistics, computer science, coding theory and cryptography. The usual difference matrices are essential for the construction of many mixed orthogonal arrays. But there are also many orthogonal arrays, especially mixed-level or asymmetrical which can not be obtained by the usual difference matrices. In order to construct these asymmetrical orthogonal arrays, a class of special matrices, so-called generalized difference matrices, were discovered by Zhang（1989, 1990, 1993） by the orthogonal decompositions of projective matrices. In this article, an interesting equivalent relationship between the orthogonal arrays and the generalized difference matrices is presented. As an application, a family of orthogonal arrays of run sizes 4p2, such as L36（6^13^42^10）, are constructed.

Orthogonal arrays obtained by generalized difference matrices with g levels

Nowadays orthogonal arrays play important roles in statistics, computer science, coding theory and cryptography. The usual difference matrices are essential for the construction for many mixed orthogonal arrays. But there are also orthogonal arrays which cannot be obtained by the usual difference matrices, such as mixed orthogonal arrays of run size 60. In order to construct these mixed orthogonal arrays, a class of special so-called generalized difference matrices were discovered by Zhang (1989,1990,1993,2006) from the orthogonal decompositions of projection matrices. In this article, an interesting equivalent relationship between orthogonal arrays and the generalized difference matrices is presented and proved. As an application, a lot of new orthogonal arrays of run size 60 have been constructed.

A SIMPLE METHOD FOR CONSTRUCTING ORTHOGONAL ARRAYS BY THE KRONECKER SUM

In this article, we propose a new general approach to constructing asymmetrical orthogonal arrays, namely the Kronecker sum. It is interesting since a lot of new mixed-level orthogonal arrays can be obtained by this method.