The complexity of error-correcting codes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1279, Issue , 1997, Pages 67-84

  Spielman, Daniel A ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; DECODING; ERRORS; POLYNOMIAL APPROXIMATION; SURVEYS;

BLOCK LENGTHS; ERROR CORRECTING CODE; GOOD CODE; LINEAR TIME; POLYNOMIAL-TIME; SHANNON BOUND;

CODES (SYMBOLS);

EID: 84958778663     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0036172     Document Type: Conference Paper

References (45)

1. A. V. Aho, J. E, Hopcroft, and J. D. Ullman. The design and analysis of computer algorithms. Addison-Wesley series in computer science and information processing. Addison-Wesley, Reading, Massachusetts, 1974.
2. N. Alon, J. Bruck, J. Naor, M. Naor, and R. M. Roth. Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs. IEEE Transactions on Information Theory, 38(2):509-516, March 1992.
3. R. B. Ash. Information Theory. Dover Publications, Inc., New York, 1965.
4. L. A. Bassalygo, V. V. Zyablov, and M. S. Pinsker. Problems of complexity in the theory of correcting codes. Problems of Information Transmission, 13(3):166-175, 1977.
5. P. Bürgisser, M. Clausen, and M. Shokrollahi. Algebraic Complexity Theory. Springer Verlag, 1996.
6. G. C. Clark and J. B. Cain. Error-Correction Coding for Digital Communication. Plenum Press, New York, 1981.
7. P. Elias. Coding for noisy channels. IRE Conv. Record, 3:37-46, 1955.
8. B. J. Prey and F. R. Ksehischang. Probability propogation and iterative decoding. In Proc. 34-th Allerton Conference of Comm., Control, and Computing, pages 482-493, October 1996.
9. J. G. D. Forney. Concatenated Codes. The MIT Press, Cambridge, Massachusetts, 1966.
10. J. G. D. Forney. The forward-backward algorithm. In Proc. 34-th Allerton Conference of Comm., Control, and Computing, pages 432-446, October 1996.
11. R. G. Gallager. Low Density Parity-Check Codes. MIT Press, Cambridge, MA, 1963.
12. S. I. Gelfand, R. L. Dobrushin, and M. S. Pinsker. On the complexity of coding. In Second International Symposium on Information Theory, pages 177-184, Akademiai Kiado, Budapest, 1973.
13. J. Justesen. A class of constructive asymptotically good codes. IEEE Transactions on Information Theory, 18:652-656, 1972.
14. J. Justesen. On the complexity of decoding Reed-Solomon codes. IEEE Transactions on Information Theory, 22(2):237-238, March 1976.
15. W. Keller-Gehrig. Fast algorithms for the characteristic polynomial. Theoretical Computer Science, 36(2-3):309-317, Apr. 1985.
16. A. Kolmogorov and V. Uspenskiĭ. On the definition of an algorithm. Uspehi Math. Nauk, 13(4):3-28, 1958. English translation in [17].
17. A. Kolmogorov and V. Uspenskiĭ. On the definition of an algorithm. American Mathematical Society Translations, 29:217-245, 1963.
18. J. D. Lafferty and D. N. Rockmore. Spectral techniques for expander codes. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pages 160-167, 1997.
19. A. Lubotzky, R. Phillips, and P. Sarnak. Ramanujan graphs. Combinatorica, 8(3):261-277, 1988.
20. D. J. C. MacKay and R. M. Neal. Near shannon limit performance of low-density parity-check codes. Elect. Lett., to appear, 1997.
21. F. J. MacWilliams and N. J. A. Sloane. The Theory of Error-Correcting Codes. North Holland, Amsterdam, 1977.
22. G. A. Margulis. Explicit group theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators. Problems of Information Transmission, 24(1):39-46, July 1988.
23. J. L. Massey. Threshold Decoding. The MIT Press, Cambridge, Massachusetts, 1973.
24. R. J. McEliece, E. R. Rodemich, H. C. Rumsey, and L. R. Welch. New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities. IEEE Transactions on Information Theory, 23:157-166, 1973.
25. V. Y. Pan. Faster solution of the key equation for decoding BCH error-correcting codes. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pages 168-175, 1997.
26. W. W. Peterson and J. E. J. Weldon. Error-Correcting Codes. The MIT Press, Cambridge, Massachusetts, 1972.
27. F. Preparata and D. Sarwate. Computational complexity of Fourier transforms over finite fields. Mathematics of Computation, 31(139):740-751, July 1977.
28. D. V. Sarwate. On the complexity of decoding Goppa codes. IEEE Transactions on Information Theory, 23(4):515-516, July 1977.
29. J. E. Savage. The complexity of decoders-part I: Decoder classes. IEEE Transactions on Information Theory, 15:689-695, November 1969.
30. J. E. Savage. The complexity of decoders-part II: Computational work and decoding time. IEEE Transactions on Information Theory, 17(1):77-85, January 1971.
31. J. E. Savage. The Complexity of Computing. John Wiley & Sons, 1976.
32. C. E. Shannon. A mathematical theory of communication. Bell System Technical Journal, 27(3):379-423, July 1948.
33. M. Sipser and D. A. Spielman. Expander codes. In Proceedings of the 35th IEEE Symposium on Foundations of Computer Science, pages 566-576, 1994.
34. M. Sipser and D. A. Spielman. Expander codes. IEEE Transactions on Information Theory, 42(6):1710-1722, 1996. preliminary version appeared as [33].
35. D. A. Spielman. Computationally efficient error-correcting codes and holographic proofs. PhD thesis, M.I.T., May 1995. Available at http://www-math.mit.edu/~spielman.
36. D. A. Spielman. Linear-time encodable and decodable error-correcting codes. In Proceedings of the 27th Annual A CM Symposium on Theory of Computing, pages 388-397, 1995.
37. D. A. Spielman. Linear-time encodable and decodable error-correcting codes. IEEE Transactions on Information Theory, 42(6):1723-1731, 1996. preliminary version appeared as [36].
38. V. Strassen. The computational complexity of continued fractions. SIAM J. Comput., 12(1):1-27, February 1983.
39. R. M. Tanner. A recursive approach to low complexity codes. IEEE Transactions on Information Theory, 27(5):533-547, September 1981.
40. J. H. van Lint. Introduction to Coding Theory. Springer-Verlag, 1992.
41. A. Vardy. Algorithmic complexity in coding theory and the minimum distance problem. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pages 92-109, 1997.
42. A. J. Viterbi and J. K. Omura. Principles of Digital Communication and Coding. McGraw-Hill, 1979.
43. N. Wiberg. Codes and decoding on general graphs. PhD thesis, University of Linköping, Sweden, 1996.
44. N. Wiberg, H.-A. Loeliger, and R. Kötter. Code and iterative decoding on general graphs. Euro. Thins. Telecommun., 6:513-526, 1995.
45. V. V. Zyablov and M. S. Pinsker. Estimation of the error-correction complexity of Gallager low-density codes. Problems of Information Transmission, 11(1):18-28, May 1976.