Explicit construction of families of linear expanders and superconcentrators is relevant to theoretical computer science in several ways. Here we construct better expanders than those previously known and use them to construct explicitly n-superconcentrators with ≈ 122.74n edges; much less than the previous most economical construction.
All Science Journal Classification (ASJC) codes
- Control and Optimization
- Computational Mathematics
- Computational Theory and Mathematics