When can an expander code correct $\hat{I}\text{c◯}(n)$ errors in $O(n)$ time?

Kuan Cheng, Minghui Ouyang, Chong Shangguan +1

Tanner codes are graph-based linear codes whose parity-check matrices can be characterized by a bipartite graph $G$ together with a linear inner code $C_0$. Expander codes are Tann…