Finding small stopping sets in the tanner graphs of LDPC codes

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

Volumn , Issue , 2006, Pages

  Richter, Gerd ^a  

^a UNIVERSITY OF ULM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BINS; CHANNEL CODING; COMMUNICATION CHANNELS (INFORMATION THEORY); FORWARD ERROR CORRECTION; GAUSSIAN NOISE (ELECTRONIC); HAMMING DISTANCE; SATELLITE COMMUNICATION SYSTEMS; SIGNAL TO NOISE RATIO; TURBO CODES; WHITE NOISE;

ADDITIVE WHITE GAUSSIAN NOISE; ASYMPTOTIC PERFORMANCE; BINARY ERASURE CHANNEL; FRAME ERROR RATE; HIGH SIGNAL-TO-NOISE RATIO; LOW-DENSITY PARITY-CHECK (LDPC) CODES; MINIMAL-HAMMING-WEIGHT; MINIMUM DISTANCE;

CODES (SYMBOLS);

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

References (23)

1. c. Berrou, A. Glavieux, and P. Thitimajshima. Near Shannon limit error-correcting coding and decoding: Turbo-codes(I). In IEEE International Conference on Communications, pages 1064-1070, Geneva, Swizerland, May 1993.
2. C. Berrou and S. Vaton. Computing the minimum distance of linear codes by the error impulse method. In IEEE Intern. Symposium on Inl Theory, Lausanne, Switzerland, July 2002.
3. F. Oanehgaran, M. Laddomada, and M. Mondin. An algorithm for the computation of the minimum distance of LOPC codes. Submitted to ETT, 2005.
4. C. Oi, O. Proietti, L 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. Inl Theory, 48(6): 1570-1579, June 2002.
5. L. Oinoi, F. Sottile, and S. Benedetto. Design of variablerate irregular LOPC codes with low error floor. In IEEE International Conference on Communications, Seoul, Korea, May 2005.
6. R. G. Gallager. Low-Density Parity-Check Codes. M.LT. Press, Cambridge, 1963.
7. X. Y. Hu, E. Eleftheriou, and O. M. Arnold. Regular and irregular progressive edge-growth Tanner graphs. IEEE Trans. Inl. Theory, 5 1( 1): 386-398, January 2005.
8. X. Y. Hu, P. C. Fossorier, and E. Eleftheriou. On the computation of the minimum distance of low-density parity-check codes. In IEEE International Conference on Communications, volume 2, pages 767-771, Paris, France, June 2004.
9. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and O. A. Spielman. Efficient erasure correcting codes. IEEE Trans. Inl. Theory, 47(2): 569-584, February 200 1.
10. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and O. A. Spielman. Improved low-density parity-check codes using irregular graphs. IEEE Trans. Inl. Theory, 47(2): 585-598, February 200 1.
11. O. J. C. MacKay. wol.ra.phy.cam.uk/mackay/codes/data.html. In Online Database of Low-Density Parity-Check Codes, 2005.
12. O. J. C. MacKay and R. M. Neal. Near Shannon limit performance of low-density parity-check codes. Electron. Lett., 32: 1645-1646, August 1996.
13. O. J. C. MacKay and M. S. Postal. Weaknesses of margulis and ramanujan-margulis low-density parity-check codes. Electronic Notes in Theoretical Computer Science, 74, 2003.
14. O. J. C. MacKay, S. T. Wilson, and M. C. Davey. Comparison of constructions of irregular codes. 36th Allerton Conference Communications, Control, and Computing, September 1998.
15. T. Richardson. Error floors of LOPC codes. In 41st Annual Allerton Conference on Communications, Control, and Computing, Allerton, England, October 2003.
16. T. J. Richardson, M. A. Shokrollahi, and R. Urbanke. Design of capacity-approaching irregular low-density parity-check codes. IEEE Trans. Inl Theory, 47(2): 6 17-637, February 200 1.
17. G. Richter and A. Hof. On a construction method of irregular LOPC codes without small stopping sets. In IEEE International Conference on Communications, Istanbul, Turkey, June 2006.
18. G. Richter, G. Schmidt, M. Bossert, and E. Costa. Optimization of a reduced-complexity decoding algorithm for LOPC codes by density evolution. In IEEE International Conference on Communications, Seoul, Korea, May 2005.
19. R. M. Tanner. A recursive approach to low complexity codes. IEEE Trans. Inl Theory, IT-27: 533-547, September 198 1.
20. T. Tian, C. R. Jones, J. O. Villasenor, and R. O. Wesel. Selective avoidance of cycles in irregular LOPC code construction. IEEE Trans. Inl Theory, 5 1( 1): 386-398, January 2004.
21. A. Vardy. T he intractability of computing the minimum distance of a code. IEEE Trans. Inl Theory, 43: 1757-1766, November 1997.
22. N. Wiberg. Codes and Decoding on General Graphs. PhD thesis, Linktiping University, Sweden, 1996.
23. J. Zhang and M. P. C. Fossorier. Shuffled iterative decoding. IEEE Trans. Commun., pages 209-213, February 2005.