A probabilistic subspace approach to the minimal stopping set problem

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

Volumn , Issue , 2006, Pages

  Hu, Xiao Yu ^a   Eleftheriou, Evangelos ^a  

^a IBM RESEARCH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

CHANNEL CODING; FORWARD ERROR CORRECTION; SATELLITE COMMUNICATION SYSTEMS; TURBO CODES;

COMBINATORIAL PROBLEM; LINEAR CODES; LOW-DENSITY PARITY-CHECK (LDPC) CODES; STOPPING SET; SUBSPACE APPROACH;

CODES (SYMBOLS);

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

References (19)

1. R. G. Gallager, "Low-density parity-check code," IRE Trans. Inform. Theory, vol. 8, pp. 21-28, 1962.
2. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding: Turbo codes," in Proc. IEEE Intl. Conf. Commun. (ICC), Geneva, Switzerland, pp. 1064-1070, 1993.
3. D. J. C. MacKay and R. M. Neal, "Good codes based on very sparse matrices," in Cryptogmphy and Coding, 5th IMA Conference (Lecture Notes in Computer Science), pp. 100-111, 1995. C. Boyd, Ed. Berlin, Germany: Springer vol. 1025.
4. D. J. C. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inform. Theory, vol. 45, pp. 399-431, Mar. 1999.
5. T. Richardson and R. Urbanke, "The capacity of lowdensity parity-check codes under message-passing decoding," IEEE Trans. Inform. Theory, vol. 47, pp. 599-618, Feb. 2001.
6. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, vol. 27, pp. 533-547, Sept. 1981.
7. C. Di, D. Proietti, E. Telatar, T. Richardson, and R. Urbanke, "Finite-length analysis of low-density parity-check codes on the binary erasure channel," IEEE Trans. Inform. Theory, vol. 48, pp. 1570-1579, June 2002.
8. D. J. C. MacKay and M. S. Postol, "Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check codes," Electronic Notes in Theoretical Computer Science, vol. 74, 2002.
9. T. Richardson, "Error floors of LDPC codes," in Proc. 41th Annual Allerton Conf.on Communication, Computing and Control, Monticello, IL, pp. 1426-1435, Oct. 2003.
10. R. Koetter and P. Vontobel, "Graph covers and iterative decoding of finite-length codes," in Proc. 3rd International Symposium on Turbo Codes fj Related Topics, Brest, Prance, pp. 75-82, Sept. 2003.
11. F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inform. Theory, vol. 47, pp. 498-519, Feb. 2001.
12. M. Luby, M. Mitzenmacher, A. Shokrollahi, and D. Spielman, "Efficient erasure correcting codes," IEEE Trans. Inform. Theory, vol. 47, pp. 569-584, Feb. 2001.
13. M. Luby, M. Mitzenmacher, A. Shokrollahi, D. Spielman, and V. Stemann, "Practical loss-resilient codes," in Proc. 29th ACM Symp. Theory of Computing, El Paso, TX, pp. 150-159, May 1997.
14. D. J. C. MacKay, Online database of low-density parity-check codes. http://wol.ra.phy.cam.uk/mackay/codes/data.html.
15. J. Rosenthal and P. O. Vontobel, "Construction of LDPC codes based on Ramanujan graphs and ideas from Margulis," in Proc. 38th Annual Allerton Conf.on Communication, Computing and Control, Monticello, IL, pp. 248-257, Oct. 2000.
16. X.-Y. Hu, M. Fossorier, and E. Eleftheriou, "On the computation of the minimum distance of low-density paritycheck codes," in Proc. IEEE Intl. Conf. Commun. (ICC), Paris, Prance, vol. 2, pp. 767-771, June 2004.
17. X.-Y. Hu, M. Fossorier, and E. Eleftheriou, "Approximate algorithms for computing the minimum distance of lowdensity parity-check codes," in Proc. IEEE Intl. Symp. Inform. Theory, Chicago, USA, p. 475, June 2004.
18. X.-Y. Hu, E. Eleftheriou, and D.-M. Arnold, "Progressive edge-growth Tanner graphs," in Proc. IEEE Global Telecommun. Conf. (GLOBECOM), San Antonio, Texas, USA, vol. 2, pp. 995-1001, Nov. 2001.
19. X.-Y. Hu, E. Eleftheriou, and D. Arnold, "Regular and irregular progressive edge-growth Tanner graphs," IEEE Trans. Inform. Theory, vol. 51, pp. 386-398, Jan. 2005.