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
Almost Euclidean subspaces of ℓN1 via expander codes
Proceedings of the nineteenth 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
IEEE Transactions on Information Theory
On the number of errors correctable with codes on graphs
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Quantum LDPC codes with positive rate and minimum distance proportional to n 1/2
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
On LP decoding of nonbinary expander codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Expander codes over reals, Euclidean sections, and compressed sensing
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
On trapping sets and guaranteed error correction capability of LDPC codes and GLDPC codes
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Braided convolutional codes: a new class of turbo-like codes
IEEE Transactions on Information Theory
Efficient reductions for non-signaling cryptographic primitives
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
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
Bounds on the minimum code distance for nonbinary codes based on bipartite graphs
Problems of Information Transmission
Waters signatures with optimal security reduction
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
IND-CCA secure cryptography based on a variant of the LPN problem
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
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 | 755.08 |
Sipser and Spielman (see ibid., vol.42, p.1717-22, Nov. 1996) have introduced a constructive family of asymptotically good linear error-correcting codes-expander codes-together with a simple parallel algorithm that will always remove a constant fraction of errors. We introduce a variation on their decoding algorithm that, with no extra cost in complexity, provably corrects up to 12 times more errors