STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
European Journal of Combinatorics
Guest column: error-correcting codes and expander graphs
ACM SIGACT News
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
ICMCTA '08 Proceedings of the 2nd international Castle meeting on Coding Theory and Applications
AAECC-18 '09 Proceedings of the 18th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Low-complexity error correction of Hamming-code-based LDPC codes
Problems of Information Transmission
Guessing facets: polytope structure and improved LP decoder
IEEE Transactions on Information Theory
On LP decoding of nonbinary expander codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
On trapping sets and guaranteed error correction capability of LDPC codes and GLDPC codes
IEEE Transactions on Information Theory
The minimum distance of graph codes
IWCC'11 Proceedings of the Third international conference on Coding and cryptology
Linear time decoding of regular expander codes
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Linear-time decoding of regular expander codes
ACM Transactions on Computation Theory (TOCT) - Special issue on innovations in theoretical computer science 2012
Local correctability of expander codes
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 754.96 |
We show that expander codes attain the capacity of the binary-symmetric channel under iterative decoding. The error probability has a positive exponent for all rates between zero and the channel capacity. The decoding complexity grows linearly with the code length