A combining method of quasi-cyclic LDPC codes by the Chinese Remainder Theorem

IEEE Communications Letters

Volumn 9, Issue 9, 2005, Pages 823-825

  Myung, Seho ^a   Yang, Kyeongcheol ^a  

^a Pohang University of Science and Technology (POSTECH)   (South Korea)

Author keywords

Chinese Remainder Theorem; Circulant permutation matrix; Low density parity check (LDPC) codes; Quasi cyclic

Indexed keywords

CODES (SYMBOLS); COMPUTER SIMULATION; DECODING; ENCODING (SYMBOLS); ITERATIVE METHODS; MATRIX ALGEBRA; THEOREM PROVING; WHITE NOISE;

CHINESE REMAINDER THEOREM; CIRCULANT PERMUTATION MATRIX; LOW DENSITY PARITY CHECK (LDPC) CODES; QUASI-CYCLIC;

COMMUNICATION CHANNELS (INFORMATION THEORY);

EID: 27844564305     PISSN: 10897798     EISSN: None     Source Type: Journal    
DOI: 10.1109/LCOMM.2005.1506715     Document Type: Article

References (9)

1. J. L. Fan, "Array codes as low-density parity-check codes," in Proc. 2nd Int. Symp. Turbo Codes, Brest, France, Sept. 4-7, 2000, pp. 543-546.
2. M. P. C. Fossorier, "Quasi-cyclic low density parity check codes from circulant permutation matrices," IEEE Trans. Inform. Theory, vol. 50, pp. 1788-1794, Aug. 2004.
3. R. G. Gallager, "Low-density parity-check codes," IRE Trans. Inform. Theory, vol. IT-8, pp. 21-28, Jan. 1962.
4. J.-L. Kim, U. N. Peled, I. Perepelitsa, V. Pless, and S. Friedland, "Explicit construction of families of LDPC codes with no 4-cycles," IEEE Trans. Inform. Theory, vol. 50, pp. 2378-2388, Oct. 2004.
5. D. J. C. MacKay and R. M. Neal, "Near Shannon limit performance of low-density parity-check codes," Electron. Lett., vol. 32, pp. 1645-1646, Aug. 1996.
6. T. J. Richardson, A. Shokrollahi, and R. Urbanke, "Design of capacity-approaching low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 47, pp. 619-637, Feb. 2001.
7. K. H. Rosen, Elementary Number Theory and Its Applications. Reading, MA: Addison-Wesley, pp. 322-324, 2000.
8. R. M. Tanner, D. Sridhara, T. Fuja, and D. J. Costello, Jr., "LDPC block and convolutional codes based on circulant matrices," IEEE Trans. Inform. Theory, vol. 50, pp. 2966-2984, Dec. 2004.
9. K. Yang and T. Helleseth, "On the minimum distance of array codes as LDPC codes," IEEE Trans. Inform. Theory, vol. 49, pp. 3268-3271, Dec. 2003.