Liu Bin, Tong Sheng, Bai Bao-ming. Algebraic Construction of Low-Density Parity-Check Codes without Short Cycles[J]. Journal of Electronics & Information Technology, 2004, 26(11): 1778-1782.
Citation:
Liu Bin, Tong Sheng, Bai Bao-ming. Algebraic Construction of Low-Density Parity-Check Codes without Short Cycles[J]. Journal of Electronics & Information Technology, 2004, 26(11): 1778-1782.
Liu Bin, Tong Sheng, Bai Bao-ming. Algebraic Construction of Low-Density Parity-Check Codes without Short Cycles[J]. Journal of Electronics & Information Technology, 2004, 26(11): 1778-1782.
Citation:
Liu Bin, Tong Sheng, Bai Bao-ming. Algebraic Construction of Low-Density Parity-Check Codes without Short Cycles[J]. Journal of Electronics & Information Technology, 2004, 26(11): 1778-1782.
In this paper, an algebraic method for the construction of regular Low Density Parity Check (LDPC) codes without short cycles is proposed. By this method, the regular LDPC codes with 8-girth can be constructed. Simulation results show that these codes can achieve better performance than randomly constructed regular LDPC codes over AWGN channels.
Gallager R G. Low density parity check codes. IRE Trans. on Information Theory, 1962, IT-8(3):208-220.[2]Wiberg N. Codes and decoding on general graphs. [Ph.D. Thesis], Sweden, Linkoping University,1996.[3]Prabhakar A, Narayanan K. Pseudorandom construction of low-density parity-check codes using linear congruential sequences. IEEE Trans. on Comm., 2002, COM-50(9): 1389-1396.[4]柯召,孙琦.数论讲义(第二版).北京:高等教育出版社,1999:29-31.[5]MacKay D J C. Good error correcting codes based on very sparse matrices. IEEE Trans. on Information Theory, 1999, IT-45(2): 399-431.