Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs

IEEE Transactions on Information Theory

Volumn 38, Issue 2, 1992, Pages 509-516

  Alon, Noga ^a   Bruck, Jehoshua ^b   Naor, Moni ^b   Naor, Joseph ^c   Roth, Ron M ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b IBM ALMADEN RESEARCH CENTER   (United States)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Expanders; independent sets; Justesen codes; Zyablov bound

Indexed keywords

MATHEMATICAL TECHNIQUES - GRAPH THEORY; PROBABILITY - RANDOM PROCESSES;

JUSTESEN CODES; PSEUDORANDOM GRAPHS; ZYABLOV BOUND;

CODES, SYMBOLIC;

EID: 0026834814     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.119713     Document Type: Article

References (29)

1. M. Ajtai, J. Komlós, and E. Szemerédi, “Deterministic simulation in LOGSPACE,” Proc. 19th ACM Symp. Theory of Comput.,1987, pp. 132–140.
2. N. Alon, “Eigenvalues and expanders,” Combinatorica, vol. 6, pp. 83–96, 1986.
3. N. Alon, “Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory,” Combinatorica, vol. 6, pp. 207–219, 1986.
4. N. Alon, “Explicit construction of exponential sized families of k-independent sets,” Discrete Math., vol. 58, pp. 191–193, 1986.
5. D. Le Brigand, “On computational complexity of some algebraic curves over finite fields,” Lecture Notes in Comput. Sci., vol. 229, pp. 223–227, 1986.
6. A. Cohen and A. Wigderson, “Dispersers, deterministic amplification and weak random sources.” in Proc. 30th Symp. Found. Comput. Sci., 1989, pp. 14–19.
7. H. Davenport, Multiplicative Number Theory, second ed., revised by H. L. Montgomery. Berlin: Springer Verlag, 1980.
8. R. Impagliazzo and D. Zuckerman, “Recycling random bits,” in Proc. 30th Symp. Found. Comput. Sci., 1989, pp. 248–253.
9. J. Justesen, “A class of constructive asymptotically good algebraic codes,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 652–656, Sept. 1972.
10. G. L. Katsman, M. A. Tsfasman, and S. G. Vladut, “Modular curves and codes with a polynomial construction,” IEEE Trans. Inform. Theory, vol. IT-30, pp. 353–355, Mar. 1984.
11. R. M. Karp and N. Pippenger, “A time randomness tradeoff,” presented at AMS Conf. Probabilistic Computat. in Complexity. Durham, NC, 1983.
12. D. J. Kleitman and J. Spencer, “Families of k-independent sets,” Discrete Math., vol. 6, pp. 255–262, 1973.
13. S. N. Litsyn and M. A. Tsfasman, “A note on lower bounds,” IEEE Trans. Inform. Theory, vol. IT-32, pp. 705–706, Sept. 1986.
14. A. Lubotzky, R. Phillips, and P. Sarnak, “Explicit expanders and the Ramanujan conjectures,” in Proc. 18th ACM Symp. Theory of Comput., 1986, 240-246; See also: “Ramanujan graphs,” Combinatorica, vol. 8, pp. 261–277, 1988.
15. F. J. MacWilliams and N.J.A. Sloane, The Theory of Error-Correcting Codes. Amsterdam: North Holland, 1977.
16. G. A. Margulis, “Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and superconcentrators,” Prob. Inform. Transm., vol. 24, pp. 39–46, 1988.
17. J. Naor and M. Naor, “Small-bias probability spaces: efficient constructions and applications,” in Proc. 22nd ACM Symp. Theory of Comput., 1990, pp. 213–223.
18. A. Nilli, “On the second eigenvalue of a graph,” Discrete Math., vol. 91, pp. 207–210, 1991.
19. J. Riordan, Combinatorial Identities. New York: John Wiley, 1968.
20. P. Sarnak, private communication.
21. G. Seroussi and N. H. Bshouty, “Vector sets for exhaustive testing of logic circuits,” IEEE Trans. Inform. Theory, vol. 34, pp. 513–522, May 1988.
22. Y. Sugiyama, M. Kasahara, S. Hirasawa, and T. Namekawa, “A modification of the constructive asymptotically good codes of Justesen for low rates,” Inform. Contr., vol. 25. pp. 341–350, 1974.
23. Y. Sugiyama, M. Kasahara, S. Hirasawa, and T. Namekawa, “A new class of asymptotically good codes beyond the Zyablov bound,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 198–204, Mar. 1978.
24. Y. Sugiyama, M. Kasahara, S. Hirasawa, and T. Namekawa, “Superimposed concatenated codes,” IEEE Trans. Inform. Theory, vol. IT-26, pp. 735–736, Nov. 1980.
25. M. A. Tsfasman, S. G. Vlădut, and Th. Zink, “Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound,” Math. Nachr., vol. 109, pp. 21–28, 1982.
26. A. Weil, “Sur les courbes algebriques et les variestes qui sen dèduisent,” Actualites Sci. Ind., p. 1041, 1948.
27. E. J. Weldon, Jr., “Justesen's construction—The low-rate case,” IEEE Trans. Inform. Theory, vol. IT-19, pp. 711–713, Sept. 1973.
28. E. J. Weldon, Jr., “Some results on the problem of constructing asymptotically good error-correcting codes,” IEEE Trans. Inform. Theory, vol. IT-21, pp. 412–417, July 1975.
29. V. V. Zyablov, “An estimate of the complexity of constructing binary linear cascade codes,” Probl. Inform. Transm., vol. 7, pp. 3–10, 1971.