Expanders from symmetric codes

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 669-677

  Meshulam, Roy ^a,b   Wigderson, Avi ^b,c  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

^c HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); EIGENVALUES AND EIGENFUNCTIONS; ITERATIVE METHODS; PROBABILITY; SET THEORY; VECTORS;

EXPANDERS; FOURIER COEFFICIENTS; SYMMETRIC CODES;

GRAPH THEORY;

EID: 0036037636     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/510002.510004     Document Type: Conference Paper

References (22)

1. Eigenvalues and expanders
2. Semi-direct product in groups and zig-zag product in graphs: Connections and applications
3. 1, isoperimetric inequalities for graphs and superconcentrators
4. A density version of a geometric ramsey theorem
5. Universal classes of hash functions
6. On the spectrum of the sum of generators for a finitely generated group
7. Storing a sparse table with o(1) worst case access time
8. Explicit construction of linear sized superconcentrators
9. Generalizations of taketa's theorem on the solvability of M-groups
10. Ramanujan graphs
11. Groups and expanders
12. Positively finitely generated groups
13. Explicit construction of concentrators
14. Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and superconcentrators
15. Groups with super-exponential subgroup growth
16. Entropy waves, the zig-zag graph product, and a new constant-degree expanders and extractors
17. Explicit construction of concentrators from generalized N-gons
18. c*-algebras associated with groups with kazhdan's property T.
19. Post-classification of jordan's theorem on finite linear groups