Construction of high-rate QC-LDPC codes

International Conference on Advanced Technologies for Communications

Volumn , Issue , 2011, Pages 24-27

  Chen, Xu ^a   Lau, Francis C M ^a  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ARRAY CODES; CODE CONSTRUCTION; CODE RATES; CONSTRUCTION ALGORITHMS; GREEDY ALGORITHMS; HIGH RATE; LOW DENSITY PARITY CHECK; QC LDPC CODES; QUASI-CYCLIC;

ALGORITHMS; CONVOLUTIONAL CODES;

ERROR CORRECTION;

EID: 82955193832     PISSN: 21621039     EISSN: 21621020     Source Type: Conference Proceeding    
DOI: 10.1109/ATC.2011.6027427     Document Type: Conference Paper

References (13)

1. M. P. C. Fossorier, "Quasi cyclic low-density parity-check codes from circulant permutation matrices," IEEE Trans. on Inf. Theory, vol. 50, no. 8, pp. 1788-1793, Aug. 2004.
2. R. M. Tanner, D. Sridhara, A. Sridharan, T. E. Fuja, and D. J. Costello Jr., "LDPC block and convolutional codes based on circulant matrices,"IEEE Trans. on Inf. Theory, vol. 50, no. 12, pp. 2966-2984, Dec. 2004.
3. W. M. Tam, F. C. M. Lau, and C. K. Tse, "A class of QC-LDPC codes with low encoding complexity and good error performance," IEEE Communications Letters, vol. 14, no. 2, pp. 169-171, Feb. 2010.
4. I. B. Djordjevic, M. Arabaci, and L. L. Minkov, "Next generation fec for high-capacity communication in optical transport networks," Journal of Lightwave Technology, vol. 27, no. 16, pp. 3518-3530, Aug. 2009.
5. X. Zheng, F. C. M. Lau, and C. K. Tse, "Constructing Short-Length Irregular LDPC Codes with Low Error Floor," IEEE Transactions on Communications, vol. 58, no. 10, pp. 2823-2834, Oct. 2010.
6. Y. Wang, J. Yedidia, and S. C. Draper, "Construction of high-girth QC-LDPC codes," in Turbo Codes and Related Topics, 2008 5th International Symposium on, 2008, pp. 180-185.
7. L. Lan, L. Zeng, Y. Y. Tai, L. Chen, S. Lin, and K. Abdel-Ghaffar, "Construction of Quasi-Cyclic LDPC codes for AWGN and binary erasure channels: A finite field approach," IEEE Transactions on Information Theory, vol. 53, no. 7, pp. 2429-2458, July 2007. (Pubitemid 47064280)
8. O. Milenkovic, N. Kashyap, and D. Leyba, "Shortened array codes of large girth," IEEE Trans. on Inf. Theory, vol. 52, pp. 3707-3722, 2006. (Pubitemid 44145129)
9. I. B. Djordjevic, L. Xu, T. Wang, and M. Cvijetic, "Large girth lowdensity parity-check codes for long-haul high-speed optical communications,"in OFC/NFOEC Conference, 2008, pp. 1-3.
10. J. L. Fan, "Array codes as low-density parity-check codes," in Proc. 2nd Int. Symp. Turbo Codes, Sept. 2000, pp. 545-546.
11. F. A. Behrend, "On sets of integers which contain no three terms in arithmetical progression," Proc. Natl. Acad. Sci., vol. 23, pp. 331-332, 1946.
12. I. Z. Ruzsa, "Solving a linear equation in a set of integers I," Acta Arith., pp. 259-282, 1993.
13. W. T. Gowers, "A new proof of Szemeredi's theorem," Geometric And Functional Analysis, vol. 11, pp. 465-588, Aug. 2001.