Design of regular (2,dc)-LDPC codes over GF(q) using their binary images

IEEE Transactions on Communications

Volumn 56, Issue 10, 2008, Pages 1626-1635

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

^a Centre national de la recherche scientifique   (France)

^b University of Hawaii at Manoa   (United States)

Author keywords

Binary image; Channel coding; Error correction coding; Iterative decoding; Non binary LDPC codes

Indexed keywords

BINARY IMAGES; CHANNEL CODING; DECODING; ERROR CORRECTION; IMAGE CODING; ITERATIVE DECODING; PROGRAMMING THEORY;

ALGEBRAIC PROPERTIES; ERROR CORRECTION CODING; ERROR FLOORS; EXCELLENT PERFORMANCES; LDPC CODES; MINIMUM DISTANCES; NON-BINARY LDPC CODES; PARITY CHECK MATRIXES; STOPPING SETS; TANNER GRAPHS; WATER-FALL;

CODES (SYMBOLS);

EID: 54949083457     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2008.060527     Document Type: Article

References (23)

1. q)," in Proc. IEEE Inf. Th. Workshop, Paris, France, Mar. 2003.
2. A. E. Brouwer and T. Verhoeff, "An updated table of minimum-distance for binary linear codes," IEEE Trans. Inform. Theory, vol. 39, no. 2, pp. 662-677, Mar. 1993.
3. S.-Y. Chung, T. J. Richardson, and R. L. Urbanke, "Analysis of sum-product decoding of low-density-parity-check codes using a Gaussian approximation," IEEE Trans. Inform. Theory, vol. 47, pp. 657-670, Feb. 2001.
4. M. C. Davey, "Error-correction using low-density parity-check codes," Ph.D. thesis, University of Cambridge, 1999.
5. M. C. Davey and D. MacKay, "Low-density parity-check codes over GF(q)," IEEE Commun. Lett., vol. 2, pp. 165-167, June 1998.
6. D. Declercq and M. Fossorier, "Decoding algorithms for nonbinary LDPC codes over GF(q)," submitted to IEEE Trans. Commmun.
7. C. Di, D. Proietti, I. E. Telatar, T. J. Richardson, and R. L. Urbanke, "Finite-length analysis of low-density parity-check codes on the binary erasure channel," IEEE Trans. Inform. Theory, vol. 48, no. 6, pp. 1570-1579, June 2002.
8. D. Divsalar, C. Jones, S. Dolinar, and J. Thorpe, "Protograph based LDPC codes with minimum distance linearly growing with block size," in Proc. IEEE GLOBECOM, vol. 3, pp. 1152-1156, St Louis, MO, USA, Nov. 2005.
9. R. G. Gallager, Low Density Parity Check Codes. Cambridge, MA: MIT Press, 1963.
10. X. Y. Hu and M. Fossorier, "On the computation of the minimum distance of low-density parity-check codes," in Proc. IEEE Int. Conf. on Commun., Paris, France, June 2004.
11. q) codes," in Proc. IEEE Int. Conf. on Commun., Paris, France, June 2004.
12. X. Y. Hu, M. Fossorier, and E. Eleftheriou, "Approximate algorithms for computating the minimum distance of low-density parity-check codes," in Proc. IEEE Int. Symp. on Inf. Theory, Chicago, USA, June 2004.
13. X.-Y. Hu, E. Eleftheriou, and D. M. Arnold, "Regular and irregular progressive edge-growth Tanner graphs," IEEE Trans. Inform. Theory vol. 51, no. 1, pp. 386-398, Jan. 2005.
14. G. Liva, W. E. Ryan, and M. Chiani, "Design of quasi-cyclic Tanner codes with low error floors," in Proc. Int. Turbo Code Symposium, Munich, Germany, Apr. 2006.
15. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman, "Improved low density parity check codes using irregular graphs," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 585-598, Feb. 2001.
16. D. J. C. Mackay, "Good error correcting codes based on very sparse matrices," IEEE Trans. Inform. Theory, vol. 45, no. 2, pp. 399-431, 1999.
17. D. MacKay, "Optimizing sparse graph codes over GF(q)," available at http://www.inference.phy.cam.ac.uk/mackay/ CodesGallager.html, Aug. 2003.
18. F. J. Mac Williams and N. J. A. Sloane, The Theory of Error-Correcting Codes. North Holland, 1978.
19. C. Poulliat, M. Fossorier, and D. Declercq, "Optimization of non binary LDPC codes using their binary images," in Proc. Int. Turbo Code Symposium, Munich, Germany, Apr. 2006.
20. C. Poulliat, M. Fossorier, and D. Declercq, "Design of non binary LDPC codes using their binary images: Algebraic properties," in Proc. IEEE Int. Symp. on Information Theory, Seattle, WA, USA, July 2006.
21. J. G. Proakis, Digital Communications. McGraw-Hill, 3rd Ed., 1995.
22. T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of capacity approching irregular low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 47, pp. 657-670, Feb. 2001.
23. T. Tian, C. R. Jones, J. D. Villasenor, and R. D. Wesel, "Selective avoidance of cycles in irregular LDPC code construction," IEEE Trans. Commun., vol. 52, no. 8, pp. 1242-1247, Aug. 2004.