Low-rate non-binary hybrid LDPC codes

2008 5th International Symposium on Turbo Codes and Related Topics, TURBOCODING

Volumn , Issue , 2008, Pages 225-230

  Sassatelli, Lucile ^a   Declercq, David ^a   Poulliat, Charly ^a  

^a Cergy Pontoise University   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DESIGN; IMAGE SEGMENTATION; PROGRAMMING THEORY; TURBO CODES;

ALGEBRAIC PROPERTIES; CODING SCHEMES; ERROR FLOORS; FINITE LENGTH CODES; FINITE LENGTHS; HADAMARD; HADAMARD CODES; LDPC CODES; LOW RATES; MINIMUM DISTANCES; PERFORMANCE IMPROVEMENTS; TANNER GRAPHS; WATER FALLS; ZIG ZAGS;

ASYMPTOTIC ANALYSIS;

EID: 57849103114     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/TURBOCODING.2008.4658702     Document Type: Conference Paper

References (18)

1. A. Viterbi, "Very low rate convolutional codes for maximum theoretical performance of spread-spectrum multiple-access channels," IEEE Journal on Selected Areas on Communications, vol. 8, pp. 641-649, May 1990.
2. T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of capacity-approaching irregular LDPC codes," IEEE Transactions on Information Theory, vol. 47, pp. 619-637, February 2001.
3. L. Ping, W. Leung, and K. Wu, "Low-rate Turbo-Hadamard codes," IEEE Transactions on Information Theory, vol. 49, pp. 3213-3224, December 2003.
4. G. Yue, W. Leung, L. Ping, and X. Wang, "Low rate concatenated Zigzag-Hadamard codes," in Proceedings of International Conference on Communications, (Istanbul, Turkey), June 2006.
5. M. González-López, F. J. Vázquez-Araújo, L. Castedo, and J. Garcia-Frias, "Layered LDGM codes: a capacity-approaching structure for arbitrary rates," in Proc. ISWCS, (Trondheim, Norway), September 2007.
6. L. Sassatelli and D. Declercq, "Non-binary hybrid LDPC codes: Structure, decoding and optimization," in Proceedings of IEEE Information Theory Workshop, (Chengdu, China), October 2006.
7. L. Sassatelli and D. Declercq, "Analysis of non-binary hybrid LDPC codes," in Proceedings of IEEE International Symposium on Information Theory, (Nice, France), June 2007.
8. C. Poulliat, M. Fossorier, and D. Declercq, "Design of regular (2,dc)-LDPC codes over GF(q) using their binary images," accepted in IEEE Transactions on Communications, 2007.
9. F. MacWilliams and N. Sloane, The theory of error-correcting codes. North Holland, 1978.
10. A. Goupil, M. Colas, G. Gelle, and D. Declercq, "FFT-based BP decoding of general LDPC codes over Abelian groups," IEEE Transactions on Communications, vol. 55, pp. 644-649, April 2007.
11. D. Declercq and M. Fossorier, "Decoding algorithms for nonbinary LDPC codes over GF(q)," IEEE Transactions on Communications, vol. 55, pp. 633-643, April 2007.
12. A. Voicila, D. Declercq, F. Verdier, M. Fossorier, and P. Urard, "Low complexity decoding for non-binary LDPC codes in high order fields," accepted for publication in IEEE Transactions on Communications, 2008.
13. L. Sassatelli and D. Declercq, "Non-binary hybrid LDPC codes," submit-ted to IEEE Transactions on Information Theory, second stage revision.
14. X.-Y. Hu, E. Eleftheriou, and D. Arnold, "Regular and irregular progressive edge-growth Tanner graphs," IEEE Transactions on Information Theory, vol. 51, pp. 386-398, January 2005.
15. A. Brouwer and T. Verhoeff, "An updated table of minimum distance for binary linear codes," IEEE Transactions on Information Theory, vol. 39, pp. 662-677, March 1993.
16. X.-Y. Hu and M. Fossorier, "On the computation of the minimum distance of low-density patity-check codes," in Proceedings of IEEE International Conference on Communications, (Paris), June 2004.
17. N. Shimanuki, B. Kurkoski, K. Yamagichi, and K. Kobayashi, "Improvements and extensions of low-rate Turbo-Hadamard codes," in Proceedings of ISITA, (Seoul, Korea), October 2006.
18. G. Liva, W. Ryan, and M. Chiani, "Design of quasi-cyclic Tanner codes with low error floors," in Proceedings of IEEE International Symposium on Turbo Codes, (Munich, Germany), April 2006.