Two constructions of LDPC codes based on pseudo-symplectic geometry over finite fields  

作　　者：Wang Xiuli Hao Yakun 

机构地区：[1]College of Science,Civil Aviation University of China

出　　处：《The Journal of China Universities of Posts and Telecommunications》2018年第2期49-59,共11页中国邮电高校学报（英文版）

基　　金：supported by the National Natural Science Foundation of China(61179026);Fundamental Research of the Central Universities of China Civil Aviation University of Science Special(3122016L005)

摘　　要：F（2v＋ 1） q Based on the pseudo-symplectic space over q of characteristics 2, combining the definition of low density parity check （LDPC） codes with the knowledge of graph theory, two kinds of LDPC codes with larger girth are constructed. By the knowledge of bipartite graph and the girth properties of LDPC codes, both the girth of the code C（m1 ,2v ＋ 1 ,q） and the code C（m2 ,2v ＋ 1 ,q） are computed are 8. The girth is larger, the performance of LDPC codes is better. Finally, according to the properties of the check matrix and the linear relation between the column vectors of the check matrix, both the minimum distances of the two codes are obtained are 2q ＋ 2.F（2v＋ 1） q Based on the pseudo-symplectic space over q of characteristics 2, combining the definition of low density parity check （LDPC） codes with the knowledge of graph theory, two kinds of LDPC codes with larger girth are constructed. By the knowledge of bipartite graph and the girth properties of LDPC codes, both the girth of the code C（m1 ,2v ＋ 1 ,q） and the code C（m2 ,2v ＋ 1 ,q） are computed are 8. The girth is larger, the performance of LDPC codes is better. Finally, according to the properties of the check matrix and the linear relation between the column vectors of the check matrix, both the minimum distances of the two codes are obtained are 2q ＋ 2.

关 键 词：LDPC codes pseudo-symplectic geometry minimum distance GIRTH 

分 类 号：O157.4[理学—数学]