Using binary images of non binary LDPC codes to improve overall performance

Turbo Codes and Related Topics; 6th International ITG-Conference on Source and Channel Coding (TURBOCODING), 2006 4th International Symposium on

Volumn , Issue , 2006, Pages

  Poulliat, Charly ^a   Fossorier, Marc ^b   Declercq, David ^a  

^a Cergy Pontoise University   (France)

^b University of Hawaii at Manoa   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; BINARY IMAGES; BINS; CHANNEL CODING; TURBO CODES;

ALGEBRAIC PROPERTIES; ERROR FLOOR; FINITE LENGTH; NON-BINARY LDPC CODES; STOPPING SET;

CODES (SYMBOLS);

EID: 84994707554     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. L. Barnault and D. Declercq, "Fast Decoding Algorithm for LDPC over GF(29)", IEEE Int. Th. Workshop, Paris, France, March 2003.
2. A.E. Brouwer and T. Verhoeff, "An Updated Table of Minimum-Distance for Binary Linear Codes", IEEE Trans.on Inf. Theory, Vol. 39, No. 2, pp. 662-677, March 1993.
3. S.-Y. Chung, T. J. Richsardson, R.L. Urbanke, "Analysis of Sum-Product Decoding of Low-Density-Parity-Check Codes using a Gaussian Approximation", IEEE Trans. on Inf. Theory, Vol. 47, pp. 657-670, February 2001.
4. M.C. Davey, Error-Correction using Low-Density Parity-Check Codes, PhD thesis, University of Cambridge, 1999.
5. M.C. Davey and D. MacKay, "Low-Density Parity-Check Codes over GF(q)", IEEE Commun. letters, Vol. 2, pp. 165167, June 1998.
6. D. Declercq and M. Fossorier, "Decoding Algorithms for Nonbinary LDPC Codes over GF(q)", submitted to IEEE Trans. on Commmunications.
7. C. Di, D. Proietti, I.E. Telatar, T.J. Richardson, R.L. Urbanke, "Finite-length Analysis of Low-Density Parity-Check Codes on the Binary Erasure Channel", IEEE Trans. on Inf. Theory, Vol. 48, No. 6, pp. 1570-1579, June 2002.
8. X.Y. Hu and M. Fossorier, "On the Computation of the Minimum Distance of Low-Density Parity-Check Codes, " IEEE Int. Conf. on Commun., Paris, France, June 2004.
9. X.Y. Hu and E. Eleftheriou, "Binary Representation of Cycle Tanner-Graph GF(29) codes, IEEE Int. Conf. on Commun., Paris, France, June 2004.
10. X.-Y. Hu, E. Eleftheriou and D.M. Arnold, "Regular and Irregular Progressive Edge-Growth Tanner Graphs", IEEE Trans. on Inf. Theory, Vol. 51, No. I, pp. 386-398, January 2005.
11. D. Mackay, "Good Codes Based on Very Sparse Matrix", IEEE Trans. On Commun." Vol. 45, No. 2, pp 399-431, 1999.
12. D. MacKay, "Optimizing Sparse Graph Codes over GF(q)", available at http://www.inference.phy.cam.ac.uklmackay7CodesGallager.html, August 2003.
13. F.J. Mac Williams and N. J. A. Sloane, The theory of Error-Correcting Codes, North Holland, 1978.
14. C. Poulliat, M. Fossorier, D. Declercq, "Optimization of LDPC Codes over GF(q) using Their Binary Image", in preparation.
15. T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of Capacity Approching Irregular Low-Density Parity-Check Codes", IEEE Trans. on Int. Theory, Vol. 47, pp.657-670, Feb. 2001.
16. T. Tian, C.R. Jones, J.D. Villasenor, R.D. Wesel, "Selective Avoidance of Cycles in Irregular LDPC Code Construction", IEEE Trans. on Commun., Vol. 52, No. 8, pp. 1242-1247, Aug. 2004.