Expander codes

IEEE Transactions on Information Theory

Volumn 42, Issue 6 PART 1, 1996, Pages 1710-1722

  Sipser, Michael ^a   Spielman, Daniel A ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Asymptotically good error correcting code; Expander graph; Linear time

Indexed keywords

DECODING; ERROR CORRECTION; GRAPH THEORY; PARALLEL ALGORITHMS; RANDOM PROCESSES;

DECODING ALGORITHMS; ERROR CORRECTING CODES; EXPANDER CODES; EXPANDER GRAPHS;

CODES (SYMBOLS);

EID: 0030290419     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.556667     Document Type: Article

References (36)

1. N. Alon, J. Brück, J. Naor, M. Naor, and R. M. Roth, Construction of asymptotically good low-rate error-correcting codes through pseudorandom graphs, IEEE Trans. Inform. Theory, vol. 38, no. 2, pp. 509-516, Mar. 1992.
2. N. Alon and F. R. K. Chung, Explicit construction of linear sized tolerant networks, Discr. Math., vol. 72, pp. 15-19, 1988.
3. N. Alon, U. Feige, A. Wigderson, and D. Zuckerman, Derandomized graph products, Comput. Complexity, pp. 60-75, 1995.
4. A. V. Aho, J. E. Hopcroft, and J. D. Ullrnan, The Design and Analysis of Computer Algorithms (Addison-Wesley series in computer science and information processing). Reading, MA: Addison-Wesley, 1974.
5. M. Ajtai, J. Komlos, and E. Szëmerédi, Deterministic simulation in logspace, in Proc. 19th Ann. ACM Symp. on Theory of Computing, 1987, pp. 132-139.
6. N. Alon, Eigenvalues and expanders, Combinatorica, vol. 6, no. 2, pp. 83-96, 1986.
7. N. Alon and J. H. Spencer, The Probabilistic Method. New York: Wiley, 1992.
8. F. Bien, Constructions of telephone networks by group representations, Notices Amer. Math. Soc., vol. 36, no. 1, pp. 5-22, 1989.
9. R. Boppana and M. Sipser, The complexity of finite functions, in Handbook of Theoretical. Computer Science, Volume A,: Algorithms and .Complexity, J. van Leeuwen, Ed. Cambridge, MA: MIT Press; Amsterdam, The Netherlands: Elsevier, 1990, pp. 757-804.
10. R. G. Gallager, Low Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
11. Y. Gurevich, Kolmogorov machines and related issues, Bull Europ. Assoc. for Theor. Clop. Sei., vol. 35, pp. 71-82, June 1988.
12. H. Imai, Essentials of Error-Control Coding Techniques. San Diego, CA: Academic Press, 1990.
13. N. Kahale, On the second eigenvalue and linear expansion of regular graphs, in Proc. 33rd IEEE Symp. on Foundations of Computer Science, 1992, pp. 296-303.
14. Expander graphs, Ph.D. dissertation, MIT, Cambridge, MA, Sept. 1993.
15. A. Kolmogorov and V. Uspenskii, On the definition of an algorithm, Usp. Mat. Nauk, vol. 13, no. 4, pp. 3-28, 1958 (English translation in [16]).
16. On the definition of an algorithm, Amer. Math. Soc. Transi, vol. 29, no. 217-245, 1963.
17. A. V. Kuznetsov, Information storage in a memory assembled from unreliable components, Probl. Inform. Transm., vol. 9, no. 3, pp. 254-264, 1973.
18. L. Levin, Theory of computation: How to start, SIGACT News, vol. 22, no. 1, pp. 47-56, 1991.
19. A. Lubotzky, R. Phillips, and P. Sarnak, Ramanujan graphs, Combinatorica, vol. 8, no. 3, pp. 261-277, 1988.
20. G. A. Margulis, Explicit constructions of concentrators, Probl. Pered. Inform., vol. 9, no. 4, pp. 71-80, Oct.-Dec. 1973 (English translation in [21]).
21. Explicit constructions of concentrators, Probl. Inform. Transm., vol. 9, pp. 325-332, 1975.
22. Explicit group theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators, Probl. Inform. Transm., vol. 24, no. 1, pp. 39-46, July 1988.
23. M. Morgenstern, Existance and explicit constructions of q + 1 regular Ramanujan graphs for every prime power q, J. Comb. Theory, Ser. B, vol. 62, pp. 44-62, 1994.
24. Natural bounded concentrators, Combinatorica, vol. 15, no. I, pp. 111-122, 1995.
25. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North Holland, 1977.
26. N. Pippenger, The memory-refresh problem, Adv. Res. in VLSI, vol. 6, p. 69, 1988, (abstract of talk).
27. 1994, personal communications.
28. J. E. Savage, The Complexity of Computing. New York: Wiley, 1976.
29. A. Schönhage, Storage modification machines, S1AM J. Comput., vol. 9, no. 3, pp. 490-508, 1980.
30. D. A. Spielman, Computationally efficient error-correcting codes and holographic proofs, Ph.D. dissertation, MIT, Cambridge, MA, May 1995 [Online.] Available WWW: http://theory.lcs.mit.edu/~spielman.
31. Linear-time encodable and decodable error-correcting codes, this issue, pp. 1723-1731.
32. R. M. Tanner, A recursive approach to low complexity codes, IEEE 'Trans. Inform. Theory, vol. IT-27, no. 5, pp. 533-547, Sept. 1981.
33. Explicit concentrators from generalized ra-gons, SIAM J. Alg. Disc. Meth., vol. 5, no. 3, pp. 287-293, Sept. 1984
34. J. H. van Lint, Introduction to Coding Theory. New York: Springer-Verlag, 1992.
35. V. V. Zyablov and M. S. Pinsker, Estimation of the error-correction complexity of Gallager low-density codes, Probl. Inform. Transm., vol. II, no. 1, pp. 18-28, May 1976
36. V. V. Zyablov, An estimate of the complexity of constructing binary linear cascade codes, Probl. Inform. Transm,., vol. 7, pp. 3-10, 1971.