37 Limitations of our work To get to 1 - R - , need s > 1/  Alphabet size = n s > n 1/   Fortunately can be reduced to 2 poly(1/  )  Concatenation + Expanders [ Guruswami-Indyk'02 ]  Lower bound is 2 1/  List size (running time) > n 1/   Open question to bring this down
{}