Algebraic construction of quasi-cyclic LDPC codes -part II: For AWGN and binary random and burst erasure channels

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3857 LNCS, Issue , 2006, Pages 265-274

  Tai, Ying Y ^a   Zeng, Lingqi ^a   Lan, Lan ^a   Song, Shumei ^a   Lin, Shu ^a  

^a University of California Davis   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY RANDOM ERASURE CHANNELS; FINITE FIELD ELEMENTS; QUASI-CYCLIC (QC) LDPC CODES; VECTOR REPRESENTATIONS;

ALGORITHMS; COMPUTATIONAL METHODS; FINITE AUTOMATA; RANDOM PROCESSES; VECTORS;

BINARY CODES;

EID: 33745638164     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11617983_26     Document Type: Conference Paper

References (6)

1. Lan Lan, Lingqi Zeng, Ying Y. Tai, Lei Chen, and Shu Lin, "Algebraic Construction of Quasi-Cyclic LDPC Codes - Part I: For AWGN and Binary Random Erasure Channels," The proceedings of the 16th Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Las Vegas, Nevada, Feb.20-24, 2006, Springer-Verlag, 2006.
2. J. Xu, L. Chen, I. Djurdjevic, S. Lin, and K. Abdel-Ghaffar, "Construction of regular and irregular LDPC codes: geometry decomposition and masking," submitted to IEEE Trans. Inform. Theory, 2004 (in revision).
3. L. Chen, I. Djurdjevic, J. Xu, S. Lin, and K. Abdel-Ghaffar, "Construction of QC-LDPC codes based on the minimum-weight codewords of Reed-Solomon codes," Proc. IEEE Int. Symp. Inform. Theory, p. 239, Chicago, IL., June 27-July 2, 2004.
4. X. -Y. Hu, E. Eleftheriou, and D. -M. Arnold, "Progressive edge-growth Tanner graphs," Proc. IEEE GLOBECOM, San Antonio, TX, Nov. 2001.
5. L. Lan, Y. Y. Tai, L. Chen, s. Lin, and Abdel-Ghaffar, "A trellis-based method for removing cycles from bipartite graphs and construction of low density parity check codes," IEEE Commun. Lett., vol. 8, no. 7, pp. 443-445, Jul. 2004.
6. T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of capacity-approaching low desnsity parity-check codes," IEEE Trans. Inform. Theory, vol. 47, pp. 619-637, Feb., 2001.