Loop removal from LDPC codes

Proceedings - 2003 IEEE Information Theory Workshop, ITW 2003

Volumn , Issue , 2003, Pages 230-233

  McGowan, J A ^a   Williamson, R C ^a  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY; SATELLITE COMMUNICATION SYSTEMS;

ADJACENCY MATRICES; EXPERIMENTAL VALUES; GRAPHICAL REPRESENTATIONS; LDPC CODES; LOW-DENSITY PARITY-CHECK (LDPC) CODES; SMALL LOOPS;

CODES (SYMBOLS);

EID: 84939189154     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITW.2003.1216737     Document Type: Conference Paper

References (14)

1. B. Bollobas and E. Szemeredi, "Girth of Sparse Graphs," Journal of phs. Addison-Wesley, Red-Graph Theory, vol. 39, pp. 194-200.2002.
2. E Buckley and E Harary, Distance in Graphs. Addison-Wesley, Red-Graph Theory, vol. 39, pp. 194-200.2002. wood, Califomia, 1990.
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. T. Etzion, A. Trachtenberg, and A. Vardy, Which Codes Have Cycle-Free Tanner Graphs?, IEEE Trans. Inform. Theory, vol. 45, pp. 2173-2181, Sep 1999.
5. R. G. Gallager, Low Density Parity Check Codes. Cambridge, MA: MIT Press, 1963.
6. S. Hoory, "The Size of Bipartite Graphs with a Given Girth," Journal of Combinatorial Theory-Series B, vol. 86(2), pp. 215-220,2002.
7. R. Kannan, P. Tetali, and S. Vempala, "Simple Markov chain algorithms for generating bipartite graphs and toumaments," in 8th Annual Symposium on Discrete Algorithms, ACM-SIAM, pp. 193-200, San Francisco, California, 1997.
8. SI M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman, "Analysis of Low Density Codes and Improved Designs Using Irregular Graphs," Proceedings of the 30th ACM Symposium on Theory of Computing, pp. 249-258, 1998.
9. 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, pp. 585-598, Feb 2001.
10. D. J. C. MacKay, "Good Error Correcting Codes based on Very Sparse Matrices," IEEE Trans. Inform. Theory, vol. 45, pp. 399-431, March 1999.
11. D. J. C. MacKay and R. M. Neal, "Near Shannon limit performance of low density parity check codes," Electronics Leners, vol. 33, pp. 457-458, March 1997.
12. G. Miller and D. Buahtein, Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes, IEEE Trans. Inform. Theory, vol. 47, pp. 2696-2710, Nov 2001.
13. J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. San Francisco, CA: Morgan Kaufmann, 1988.
14. T. Richardson and R. Urbanke, The capacity of low-density parity check codes under message-passing decoding, IEEE Trans. Inform. Theory, vol. 47, pp. 599-618, Feb 2001.