On codes from hypergraphs

European Journal of Combinatorics

Volumn 25, Issue 3, 2004, Pages 339-354

  Bilu, Yonatan ^a   Hoory, Shlomo ^b  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0842282116     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejc.2003.10.002     Document Type: Article

References (12)

1. Alon N. Feige U. Wigderson A. Zuckerman D. Derandomized graph products Comput. Complexity 5 1 1995 60-75
2. Alon N. Spencer J.H. The Probabilistic Method 2000 Wiley-Interscience
3. Barg A. Zémor G. Error exponents of expander codes IEEE Trans. Inform. Theory 48 6 2002 1725-1729 (special issue on Shannon theory: perspective, trends, and applications)
4. Friedman J. Relative expanders or weakly relatively Ramanujan graphs Duke Math. J. 118 2003 19-35
5. V. Guruswami, P. Indyk, Expander-based constructions of efficiently decodable codes, 42nd Symposium on Foundations of Computer Science, 2001
6. Lubotzky A. Phillips R. Sarnak P. Ramanujan graphs Combinatorica 8 3 1988 261-277
7. Margulis G.A. Explicit construction of expanders Problemy Peredachi Informatsii 9 4 1973 71-80
8. Sipser M. Spielman D.A. Expander codes IEEE Trans. Inform. Theory 42 1996 1710-1722
9. D.A. Spielman, Computationally efficient error-correcting codes and holographic proofs, Ph.D. Thesis, MIT, 1995
10. Tanner M. A recursive approach to low-complexity codes IEEE Trans. Inform. Theory IT-27 1981 533-547
11. van Lint J.H. Introduction to Coding Theory third ed 1999 Springer-Verlag Berlin
12. G. Zémor, On expander codes, IEEE Trans. Inform. Theory 47 (2001) 835-837.