Which codes have cycle-free tanner graphs?

IEEE Transactions on Information Theory

Volumn 45, Issue 6, 1999, Pages 2173-2181

  Etzion, Tuvi ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Iterative decoding; Linear codes; Minimum distance; Tanner graphs

Indexed keywords

BINARY CODES; BLOCK CODES; CONVERGENCE OF NUMERICAL METHODS; DECODING; ITERATIVE METHODS; MAXIMUM LIKELIHOOD ESTIMATION; OPTIMIZATION; THEOREM PROVING;

ITERATIVE DECODING; LINEAR CODES; MINIMUM DISTANCE; TANNER GRAPHS;

GRAPH THEORY;

EID: 0033185019     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.782170     Document Type: Article

References (30)

1. S. M. Aji and R. J. McEliece, "A general algorithm for distributing information in a graph," in Proc. IEEE Int. Symp. Information Theory (Ulm, Germany, 1997), p. 6.
2. S. M. Aji and R. J. McEliece, "The generalized distributive law," IEEE Trans. Inform. Theory, submitted for publication, July 1998.
3. L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, "Optimal decoding of linear codes for minimizing symbol error rate," IEEE Trans. Inform. Theory, vol. IT-20, pp. 284-287, 1974.
4. C. Berrou and A. Glavieux, "Near optimum error correcting coding and decoding: Turbo-codes," IEEE Trans. Commun., vol. 44, pp. 1261-1271, 1996.
5. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding: Turbo codes," in Proc. IEEE Int. Conf. Communications (Geneva, Switzerland, 1993), pp. 1064-1070.
6. J. Bruck and M. Blaum, "Neural networks, error-correcting codes, and polynomials over the binary ra-cube," IEEE Trans. Inform. Theory, vol. 35, pp. 976-987, 1989.
7. M. Esmaeili and A. K. Khandani, "Acyclic Tanner graphs and maximum-likelihood decoding of linear block codes," preprint, May 1998.
8. J. Feigenbaum, G. D. Forney Jr., B. H. Marcus, R. J. McEliece, and A. Vardy, Eds., Special Issue on "Codes and Complexity," IEEE Trans. Inform. Theory, vol. 42, pp. 1649-2064, Nov. 1996.
9. G. D. Forney Jr., "The forward-backward algorithm," in Proc. 34th Allerton Conf. Communication, Control, and Computing (Monticello, IL., Oct. 1996), pp. 432-446.
10. B. J. Frey, "Bayesian networks for pattern classification, data compression, and channel coding," Ph.D. dissertation, Univ. Toronto, Toronto, Ont., Canada, July 1997.
11. R. G. Gallager, "Low-density parity-check codes," IRE Trans. Inform. Theory, vol. IT-8, pp. 21-28, 1962.
12. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
13. S. L. Hakimi and J. Bredeson, "Graph theoretic error-correcting codes," IEEE Trans. Inform. Theory, vol. IT-14, pp. 584-591, 1968.
14. S. L. Hakimi and H. Frank, "Cut-set matrices and linear codes," IEEE Trans. Inform. Theory, vol. IT-11, pp. 457-458, 1965.
15. F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inform. Theory, submitted for publication, July 1998.
16. D. J. C. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inform. Theory, vol. 45, pp. 399-431, Mar. 1999.
17. "Gallager codes that are better than turbo codes," in Proc. 36th Allerton Conf. Communication, Control, and Computing (Monticello, IL., Sept. 1998).
18. D. J. C. MacKay and R. M. Neal, "Near Shannon limit performance of low-density parity-check codes," Electron. Lett., vol. 32, pp. 1645-1646, 1996.
19. F. J. Mac Williams and N. J. A. Sloane, The Theory of Error-Correcting Codes. New York: North-Holland, 1977.
20. J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. San Mateo, CA: Kaufmann, 1988.
21. W. W. Peterson and E. J. Weldon Jr., Error-Correcting Codes, 2nd ed. Cambridge, MA: MIT Press, 1961.
22. M. Sipser and D. A. Spielman, "Expander codes," IEEE Trans. Inform. Theory, vol. 42, pp. 1710-1722, 1996.
23. P. Sole and T. Zaslavsky, "The covering radius of the cycle code of a graph," Discr. Appl. Math., vol. 45, pp. 63-70, 1993.
24. "A coding approach to signed graphs," SIAM J. Discr. Math., vol. 7, pp. 544-553, 1994.
25. D. A. Spielman, "Linear-time encodable and decodable codes," IEEE Trans. Inform. Theory, vol. 42, pp. 1723-1731, 1996.
26. R. M. Tanner, "A recursive approach to low-complexity codes," IEEE Trans. Inform. Theory, vol. IT-27, pp. 533-547, 1981.
27. A. Vardy, "Trellis structure of codes," in Handbook of Coding Theory, V. S. Pless and W. C. Huffman, Eds. Amsterdam, The Netherlands: Elsevier, 1998, pp. 1989-2118.
28. D. B. West, Introduction to Graph Theory Englewood Cliffs, NJ: Prentice-Hall, 1996.
29. N. Wiberg, "Codes and decoding on general graphs," Ph.D. dissertation, Dep. Elec. Eng., Univ. Linköping, Linköping, Sweden, Apr. 1996.
30. N. Wiberg, H.-A. Loeliger, and R. Kotier, "Codes and iterative decoding on general graphs," Euro. Trans. Telecommun., vol. 6, pp. 513-526, 1995.