Linear-time encodable and decodable error-correcting codes

IEEE Transactions on Information Theory

Volumn 42, Issue 6 PART 1, 1996, Pages 1723-1731

  Spielman, Daniel A ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Asymptotically good error correcting code; Expander graph; Linear time; Superconcentrators

Indexed keywords

DECODING; ENCODING (SYMBOLS); ERROR CORRECTION; GRAPH THEORY; MULTIPLEXING EQUIPMENT; RANDOM PROCESSES;

ERROR CORRECTING CODES; EXPANDER GRAPH; LINEAR TIME; LOGARITHMIC DEPTH CIRCUITS;

CODES (SYMBOLS);

EID: 0030283874     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.556668     Document Type: Article

References (26)

1. N. Alon and F. R. K. Chung, Explicit construction of linear sized tolerant networks, Discr. Math., vol. 72, pp. 15-19, 1988.
2. 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). Reading, MA: Addison-Wesley, 1974.
3. N. Alon, Eigenvalues and expanders, Combinatorica, vol. 6, no. 2, pp. 83-96, 1986.
4. F. Bien, Constructions of telephone networks by group representations, Notices Amer, Math. Soc., vol. 36, no. 1, pp. 5-22, 1989.
5. L. A. Bassalygo, V. V. Zyablov, and M. S. Pinsker, Problems of complexity in the theory of correcting codes, Probl. Inform. Transm., vol. 13, no. 3, pp. 166-175, 1977.
6. S. I. Gelfand, R. L. Dobrushin, and M. S. Pinsker, On the complexity of coding, in 2nd Int. Symp. on Information Theory (Akademiai Kiado, Budapest, Hungary, 1973), pp. 177-184.
7. O. Gabher and 7.. Galil, Explicit constructions of linear-sized superconcentrators, J. Comput. Syst. Sei., vol. 22, pp. 40720, 1981.
8. J. Justesen, On the complexity of decoding Reed-Solomon codes, IEEE Trans. Inform. Theory, vol. IT-22, no. 2, pp. 237-238, Mar. 1976.
9. 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.
10. A. Kolmogorov and V. Uspenskif, On the definition of an algorithm, Usp. Mat. Nauk, vol. 13, no. 4, pp. 3-28, 1958 (English translation in[111]
11. On the definition of an algorithm, Amer. Math. Sod. Transi. vol. 29, pp. 217-245, 1963.
12. A. Lubotzky, R. Phillips, and P. Sarnak, Ramanujan graphs, Combinatorica, vol. 8, no. 3, pp. 261-277, 1988.
13. G. A. Margulis, Explicit constructions of concentrators, Probl. Pered. Inform., vol. 9, no. 4, pp. 71-80, Oct.-Dec. 1973. English translation in [14].
14. Explicit constructions of concentrators, Probl. Inform. Transm., vol. 9, pp. 325-332, 1975.
15. 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.
16. M. Morgenstern, Existancc 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.
17. Natural bounded concentrators, Combinatorica, vol. 15, no. 1, pp. 111-122, 1995.
18. F. J. Mac Williams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North Holland, 1977.
19. N. Pippenger, Superconcentrators, SIAM J. Comput., vol. 6, pp. 298-304, 1977.
20. Self-routing Superconcentrators, in Proc. 25th Annual ACM Symp. on Theory of Computing, S993, pp. 355-361.
21. D. V. Sarwate, On the complexity of decoding Goppa codes, IEEE Trans. Inform. Theory, vol. IT-23, no. 4, pp. 515-516, July 1977.
22. J. E. Savage, The complexity of decoders-Part I: Decoder classes, IEEE Trans. Inform. Theory, vol. IT-15, pp. 689-695, Nov. 1969.
23. The complexity of decoders-Part II: Computational work and decoding time, IEEE Trans. Inform. Theory, vol. IT-17, no. 1, pp. 77-85, Jan. 1971.
24. A. Schönhage, Storage modification machines, SIAM J. Comput., vol. 9, no. 3, pp. 490-508, 1980.
25. M. Sipser and D. A. Spielman, Expander codes, this issue, pp. 1710-1722.
26. R. M. Tanner, Explicit concentrators from generalized n-gons, SIAM J. Alg. Disc. Meth., vol. 5, no. 3, pp. 287-293, Sept. 1984.