A combinatorial family of near regular LDPC codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2007, Pages 761-765

  Krishnan, K Murali ^a   Singh, Rajdeep ^a   Chandran, L Sunil ^a   Shankar, Priti ^a  

^a INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

AVERAGE DEGREE; INTERNATIONAL SYMPOSIUM;

CONTROL THEORY; CYBERNETICS; DECODING; INFORMATION THEORY; ITERATIVE DECODING; ITERATIVE METHODS; POLYETHYLENE GLYCOLS; SIGNAL TO NOISE RATIO; TECHNICAL PRESENTATIONS;

CODES (SYMBOLS);

EID: 51649130192     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2007.4557316     Document Type: Conference Paper

References (20)

1. L. Lan, Y. Y. Tai, L. Chen, S. Lin and K. Abdel-Ghaffar, "A trellis-based method for removing cycles from bipartite graphs and construction of low density parity check codes." IEEE Communication tetters, vol. 8, no. 7, pp. 443-445, July 2004.
2. D. J. C. MacKay. Online Database of Low-Density Parity-Check Codes. Online: http://www.inference.phy.cam.ac.uk/mackay/CodesFiles.html.
3. C. Di, D. Proietli, I. B. Telalar, T. J. Richardson and R. Urbanke, "Finite length analysis of low-density parity-check codes on the binary erasure channel." IEEE Trans. Inf. Theory., Vol. 48, no. 6, pp. 1570-1579, June 2002.
4. T. Tian, C. Jones, J. D. Villasenor, R. D. Wesel, "Construction of irregular LDPC codes with low error floors." IEEE Intl. Conf. Comm., 2003, pp. 3125-3129.
5. A. Ramamoorthy, R. Wesel, "Construction of short block length irregular LDPC codes." ICC 2004. Paris, June 2004.
6. A. Orlitsky, R. Urbanke, K. Viswanathan, J. Shang. "Stopping sets and girth of Tanner graphs," ISIT 2002, June 2002.
7. M. Tanner, "A recursive approach to low-complexity codes." IEEE Trans. Info. Theory, Vol. 27, pp. 533-547, Sept 1981.
8. L. Sunil Chandran, "A High girth graph construction," SIAM J. Discrete Math., Vol. 16, no. 3, pp. 366-370, 2003.
9. R. M. Tanner, D. Sridhara, T. Fuja, "A class of group structured LDPC codes," Proc. ICSTA 2001, Ambleside, England. 2001.
10. R. G. (Gallager, "Low density parity-check codes," MIT Press, 1963.
11. R. M. Tanner, D. Sridhara, A. Sridharan, T. Fuja, D. J. Costello Jr., "LDPC block and convolualional codes based on circulanl matrices," IEEE Trans. Info. Theory. Vol. 50, no. 12, 2004.
12. C. Kelley, D. Sridhara, "Pseudocodewords of Tanner Graphs," arXiv: CS. IT/0504013, April 2005.
13. M. (G. Luby, M. Mitzenmacher, M. A. Shokrollahi, D. Spielman, "Improved low density parity check codes using irregular graphs and belief propagation," IEEE Trans. Info. Theory, %1 47, pp.585-588. Feb. 2001.
14. Y. Kou, S. Lin, M. Fossorier, "Low density parity check codes based on finite geometries: A rediscovery and new results," IEEE Trans. Info. Theory. Vol 47, pp.2711-2736, Nov. 2001.
15. B. Vasic, O. Milenkovic, "Combinatorial constmctions of low density parity check codes for iterative decoding," IEEE Trans. Info. Theory, Vol 50, No. 6, June 2001.
16. H. Tang, J. Xu, Y. Mou, S. Lin, K. Abdel-Ghaffar, "On algebraic construction of Gallager and circulanl low-density parity-check codes," IEEE. Trans. Info. Theory. Vol. 50. No. 6, June 2004.
17. M. Sipser, D. A. Spielman. "Expander Codes." IEEE. Trans. Info. Theory, Vol. 42, pp.1710-1722, Nov 1996.
18. J. Rosenthal. P. O. Vontobel, "constructions of regular and irregular LDIPC codes using Ramanujan graphs and ideas from Margulis," Proc. ISTT 2001, p 4. June 2001.
19. Xiao-Yu Hu, "Regular and irregular progressive edge-growth Tanner graphs," IEEE. Trans. Info. Theory, vol. 51, no. 1. Jan 2005 pp. 386-398.
20. G. Zemor, "On expander codes," IEEE. Trans. Info. Theaiy, vol. 47. no. 2, pp. 386-398, Jan 2001.