Table of Contents Author Guidelines Submit a Manuscript
Research Letters in Communications
Volume 2008, Article ID 354137, 5 pages
http://dx.doi.org/10.1155/2008/354137
Research Letter

Design LDPC Codes without Cycles of Length 4 and 6

1Office of Academic Affairs, Central University for Nationalities, Beijing 100081, China
2Institute of Information Science, Beijing Jiaotong University, Beijing 100044, China
3Department of Information and Communications, Gwangju Institute of Science and Technology, Gwangju 500712, South Korea

Received 2 January 2008; Accepted 25 February 2008

Academic Editor: Guosen Yue

Copyright © 2008 Jun Fan et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. R. M. Tanner, “A recursive approach to low complexity codes,” IEEE Transactions on Information Theory, vol. 27, no. 5, pp. 533–547, 1981. View at Publisher · View at Google Scholar
  2. D. J. C. MacKay, “Good error-correcting codes based on very sparse matrices,” IEEE Transactions on Information Theory, vol. 45, no. 2, pp. 399–431, 1999. View at Publisher · View at Google Scholar
  3. R. Lucas, M. P. C. Fossorier, Y. Kou, and S. Lin, “Iterative decoding of one-step majority logic decodable codes based on belief propagation,” IEEE Transactions on Communications, vol. 48, no. 6, pp. 931–937, 2000. View at Publisher · View at Google Scholar
  4. S. Kim, J.-S. No, H. Chung, and D.-J. Shin, “Girth analysis of Tanner's (3,5) QC LDPC codes,” in Proceedings of IEEE International Symposium on Information Theory (ISIT '05), pp. 1632–1636, Adelaide, SA, Australia, September 2005. View at Publisher · View at Google Scholar
  5. J. Lu, J. M. F. Moura, and U. Niesen, “Grouping-and-shifting designs for structured LDPC codes with large girth,” in Proceedings of IEEE International Symposium on Information Theory (ISIT '04), p. 236, Chicago, Ill, USA, June-July 2004. View at Publisher · View at Google Scholar
  6. B. Vasic, K. Pedagani, and M. Ivkovic, “High-rate girth-eight low-density parity-check codes on rectangular integer lattices,” IEEE Transactions on Communications, vol. 52, no. 8, pp. 1248–1252, 2004. View at Publisher · View at Google Scholar
  7. H. Song, J. Liu, and B. V. K. Vijaya Kumar, “Large girth cycle codes for partial response channels,” IEEE Transactions on Magnetics, vol. 40, no. 4, pp. 3084–3086, 2004. View at Publisher · View at Google Scholar
  8. J. Lu, J. M. F. Moura, and U. Niesen, “A class of structured LDPC codes with large girth,” in Proceedings of IEEE International Conference on Communications, vol. 1, pp. 425–429, Paris, France, June 2004. View at Publisher · View at Google Scholar
  9. H. Zhang and J. M. F. Moura, “The design of structured regular LDPC codes with large girth,” in Proceedings of IEEE Global Telecommunications Conference (GLOBECOM '03), vol. 7, pp. 4022–4027, San Francisco, Calif, USA, December 2003. View at Publisher · View at Google Scholar
  10. Y. Xiao and M. H. Lee, “Construction of good quasi-cyclic LDPC codes,” in Proceedings of IET International Conference on Wireless Mobile and Multimedia Networks (ICWMMN '06), p. 172, Hangzhou, China, November 2006. View at Publisher · View at Google Scholar
  11. R. M. Tanner, D. Sridhara, A. Sridharan, T. E. Fuja, and D. Costello Jr., “LDPC block and convolutional codes based on circulant matrices,” IEEE Transactions on Information Theory, vol. 50, no. 12, pp. 2966–2984, 2004. View at Publisher · View at Google Scholar
  12. J. Fan and Y. Xiao, “A method of counting the number of cycles in LDPC codes,” in Proceedings of the 8th International Conference on Signal Processing (ICSP '06), vol. 3, pp. 2183–2186, Guilin, China, November 2006.
  13. D. J. C. MacKay, “Encyclopedia of sparse graph codes [EB/OL],” http://www.inference.phy.cam.ac.uk/mackay/codes/data.html.