Good expander graphs and expander codes: Parameters and decoding

Abstract

We present some explicit constructions of families of constant degree expander graphs. We use them to give constructions of expander codes and determine stronger bounds on their parameters. We also show that some of these codes can be decoded very efficiently using the decoding algorithm recently given by Janwa and Lal. © Springer-Verlag Berlin Heidelberg 2003.