This paper is concerned with (3,n) and (4,n) regular quasi-cyclic Low Density Parity Check (LDPC) code constructions from elementary number theory.Given the column weight,we determine the shift values of the circulant...This paper is concerned with (3,n) and (4,n) regular quasi-cyclic Low Density Parity Check (LDPC) code constructions from elementary number theory.Given the column weight,we determine the shift values of the circulant permutation matrices via arithmetic analysis.The proposed constructions of quasi-cyclic LDPC codes achieve the following main advantages simultaneously:1) our methods are constructive in the sense that we avoid any searching process;2) our methods ensure no four or six cycles in the bipartite graphs corresponding to the LDPC codes;3) our methods are direct constructions of quasi-cyclic LDPC codes which do not use any other quasi-cyclic LDPC codes of small length like component codes or any other algorithms/cyclic codes like building block;4)the computations of the parameters involved are based on elementary number theory,thus very simple and fast.Simulation results show that the constructed regular codes of high rates perform almost 1.25 dB above Shannon limit and have no error floor down to the bit-error rate of 10-6.展开更多
Higher mathematics is more extensive, profound and abstract than elementary mathematics; it is the development and sublimation of elementary mathematics. They have a deep connection, determinant and matrix theories or...Higher mathematics is more extensive, profound and abstract than elementary mathematics; it is the development and sublimation of elementary mathematics. They have a deep connection, determinant and matrix theories originated in Elementary Mathematics, in tum, they also can be used as tools to solve related problems, and they have important roles in guiding the study of elementary mathematics. This paper will introduce the methods of solving some recursive sequence problems by constructing determinants and matrices.展开更多
In this paper, a characterization of all pentavalent arc-transitive graphs is given. It is shown that each pentavalent arc-transitive covering graph F is a regular simple or elementary abelian covering graph. In parti...In this paper, a characterization of all pentavalent arc-transitive graphs is given. It is shown that each pentavalent arc-transitive covering graph F is a regular simple or elementary abelian covering graph. In particular, the elementary abelian covering groups are Z3,Z5or a subgroup of Z2^5.展开更多
基金supported by the National Natural Science Foundation of China under Grants No.61172085,No.61103221,No.61133014,No.11061130539 and No.61021004
文摘This paper is concerned with (3,n) and (4,n) regular quasi-cyclic Low Density Parity Check (LDPC) code constructions from elementary number theory.Given the column weight,we determine the shift values of the circulant permutation matrices via arithmetic analysis.The proposed constructions of quasi-cyclic LDPC codes achieve the following main advantages simultaneously:1) our methods are constructive in the sense that we avoid any searching process;2) our methods ensure no four or six cycles in the bipartite graphs corresponding to the LDPC codes;3) our methods are direct constructions of quasi-cyclic LDPC codes which do not use any other quasi-cyclic LDPC codes of small length like component codes or any other algorithms/cyclic codes like building block;4)the computations of the parameters involved are based on elementary number theory,thus very simple and fast.Simulation results show that the constructed regular codes of high rates perform almost 1.25 dB above Shannon limit and have no error floor down to the bit-error rate of 10-6.
文摘Higher mathematics is more extensive, profound and abstract than elementary mathematics; it is the development and sublimation of elementary mathematics. They have a deep connection, determinant and matrix theories originated in Elementary Mathematics, in tum, they also can be used as tools to solve related problems, and they have important roles in guiding the study of elementary mathematics. This paper will introduce the methods of solving some recursive sequence problems by constructing determinants and matrices.
文摘In this paper, a characterization of all pentavalent arc-transitive graphs is given. It is shown that each pentavalent arc-transitive covering graph F is a regular simple or elementary abelian covering graph. In particular, the elementary abelian covering groups are Z3,Z5or a subgroup of Z2^5.
