二元域上有限几何LDPC码的停止距离#br#

中国民航大学学报 ›› 2019, Vol. 37 ›› Issue (4): 57-59.

二元域上有限几何LDPC码的停止距离#br#

高有，马赫

（中国民航大学理学院，天津300300）

出版日期:2019-08-23 发布日期:2020-04-01
作者简介:高有（1966—），男，内蒙古乌兰察布人，教授，博士，研究方向为代数、密码与编码.
基金资助:
国家自然科学基金项目（11701558）

Stopping distance of finite geometry LDPC codes over binary field#br#

GAO You, MA He#br#

（College of Science, CAUC, Tianjin 300300, China）

Online:2019-08-23 Published:2020-04-01

摘要/Abstract

摘要： 停止距离是分析LDPC 码在二元擦除信道上的迭代译码表现时的一个重要参数。为了研究二元域上有限几何LDPC 码的停止距离，需根据码的校验阵找到一个最小的停止集。根据有限几何LDPC 码停止距离的下界及仿射空间与射影空间的几何性质，通过寻找达到停止距离下界的停止集的方法，得出了一些特殊情况下二元域上有限几何LDPC 码的停止距离。

关键词: LDPC 码, 仿射空间, 射影空间, 停止集, 停止距离

Abstract: Stopping distance is an important parameter in the analysis of LDPC code performance under iterative decoding on a binary erasure channel. To study the stopping distance of finite geometry LDPC code over binary field, it is necessary to find a minimum stopping set from the parity -check matrix of the codes. According to the lower bound of stopping distance of finite geometry LDPC codes, a stopping set which reaches the lower bound is found by using the geometric properties of affine space and projective space. Then the stopping distance of finite geometry LDPC codes over binary filed in some special cases is obtained.

Key words: LDPC code, affine space, projective space, stopping set, stopping distance

中图分类号:

O157.4

高有, 马赫. 二元域上有限几何LDPC码的停止距离#br#[J]. 中国民航大学学报, 2019, 37(4): 57-59.

GAO You, MA He. Stopping distance of finite geometry LDPC codes over binary field#br#[J]. Journal of Civil Aviation University of China, 2019, 37(4): 57-59.

参考文献 9

[1]	GALLAGER R G. Low-density parity-check codes[J]. IRE Transactions on Information Theory, 1962, 8(1): 21-28.
[2]	DI C, PROIETTI D, TELATARI E, et al. Finite-length analysis of low density parity-check codes on the binary erasure channel[J]. IEEE Transactions on Information Theory, 2002, 48(6): 1570-1579.
[3]	KOU Y, LIN SHU, FOSSORIER M P C. Low -density parity -check codes based on finite geometries: A rediscovery and new results[J].IEEE Transactions on Information Theory, 2001, 47(7): 2711-2736.
[4]	TANG HENG, XU JUN, LIN SHU, et al. Codes on finite geometries[J].IEEE Transactions on Information Theory, 2005, 51(2): 572-596.
[5]	KASHYAP N, VARDY A. Stopping sets in codes from designs[C]//IEEE International Symposium on Information Theory, Yokohama, Japan, June 29-July 4, 2003: 122.
[6]	XIA SHUTAO, FU FANGWEI. On the stopping distance of finite geometry LDPC codes[J]. IEEE Communications Letters, 2006, 10(5): 381-383.
[7]	WAN ZHE XIAN. Geometry of classical groups over finite fields[M].2nd ed. Beijing: Science Press, 2002.
[8]	SCHWARTZ M, VARDY A. On the stopping distance and the stopping redundancy of codes[J]. IEEE Transactions on Information Theory, 2006,52(3): 922-932.
[9]	冯克勤.纠错码的代数理论[M].北京:清华大学出版社, 2005.