We study the classical expander codes, introduced by Sipser and Spielman \cite{SS96}. Given any constants $0< \alpha, \varepsilon < 1/2$, and an arbitrary bipartite graph with $N$ vertices on the left, $M < N$ vertices on the right, and left degree $D$ such that any left subset $S$ of size at most $\alpha N$ has at least $(1-\varepsilon)|S|D$ neighbors, we show that the corresponding linear code given by parity checks on the right has distance at least roughly $\frac{\alpha N}{2 \varepsilon }$. This is strictly better than the best known previous result of $2(1-\varepsilon ) \alpha N$ \cite{Sudan2000note, Viderman13b} whenever $\varepsilon < 1/2$, and improves the previous result significantly when $\varepsilon $ is small. Furthermore, we show that this distance is tight in general, thus providing a complete characterization of the distance of general expander codes. Next, we provide several efficient decoding algorithms, which vastly improve previous results in terms of the fraction of errors corrected, whenever $\varepsilon < \frac{1}{4}$. Finally, we also give a bound on the list-decoding radius of general expander codes, which beats the classical Johnson bound in certain situations (e.g., when the graph is almost regular and the code has a high rate). Our techniques exploit novel combinatorial properties of bipartite expander graphs. In particular, we establish a new size-expansion tradeoff, which may be of independent interests.

翻译：我们研究了由Sipser和Spielman {cite{ssta{s96}推出的古典扩张码。根据任何常数 $0 < alpha,\ varepsilon < 1/2 美元,以及任意的双叶图,左面有1美元,左面有1美元,右面有1美元,左面有1美元,左面有1美元,左面有1美元,每面1美元,每面1美元,左面1美元,每面1美元,每面1美元,右面平面检查给出的相应线性代码至少有大约1美元,左面2美元,左面2美元,左面2美元,左面1美元,左面1美元,左面1美元,左面1美元,左面1美元,左面1美元,左面1美元,每面1美元,每面1美元,右面1美元,右面1美元,右面1美元,右面1美元,右面1美元,直线代码至少1美元,直线值1美元,直线值1美元,直线值1美元,直方值1美元,直方有1美元,直面1美元,直方值1美元,直方,直方,直方。最后,直方显示,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方计算,直方,直方,直方,直方,直方,直,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方,直方