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.
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.
