Algorithmic complexity in coding theory and the minimum distance problem
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Practical loss-resilient codes
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Spectral techniques for expander codes
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Analysis of low density codes and improved designs using irregular graphs
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Chinese remaindering with errors
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Randomness conductors and constant-degree lossless expanders
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
An introduction to low-density parity-check codes
Theoretical aspects of computer science
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
An Introduction to Low-Density Parity-Check Codes
Theoretical Aspects of Computer Science, Advanced Lectures [First Summer School on Theoretical Aspects of Computer Science, Tehran, Iran, July 2000]
Linear time encodable and list decodable codes
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Computer algebra handbook
Fast approximate probabilistically checkable proofs
Information and Computation
A new family of Cayley expanders (?)
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Guest column: error-correcting codes and expander graphs
ACM SIGACT News
On uniform amplification of hardness in NP
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
EURASIP Journal on Applied Signal Processing
Algorithmic results in list decoding
Foundations and Trends® in Theoretical Computer Science
Proceedings of the forty-first annual ACM symposium on Theory of computing
On the design and alphabet size of Roth-Skachek nearly MDS expander codes
MATH'08 Proceedings of the 13th WSEAS international conference on Applied mathematics
AAECC-18 '09 Proceedings of the 18th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Research and performance evaluation of data replication technology in distributed storage systems
Computers & Mathematics with Applications
LDPC coded MIMO OFDM-based IEEE 802.11n wireless LAN
WOCN'09 Proceedings of the Sixth international conference on Wireless and Optical Communications Networks
Capacity achieving codes from randomness conductors
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
On LP decoding of nonbinary expander codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Good expander graphs and expander codes: parameters and decoding
AAECC'03 Proceedings of the 15th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Data stream algorithms for codeword testing
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Algorithms and theory of computation handbook
Design of nonbinary rate-compatible LDPC codes utilizing bit-wise shortening method
IEEE Communications Letters
Security of quantum key distribution with imperfect devices
Quantum Information & Computation
Lossless fault-tolerant data structures with additive overhead
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Efficient probabilistically checkable debates
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Linear time decoding of regular expander codes
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Information theory and the security of binary data perturbation
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
Hardness amplification via space-efficient direct products
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Achievable complexity-performance tradeoffs in lossy compression
Problems of Information Transmission
Constant-Overhead secure computation of boolean circuits using preprocessing
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Linear-time decoding of regular expander codes
ACM Transactions on Computation Theory (TOCT) - Special issue on innovations in theoretical computer science 2012
Practical dynamic proofs of retrievability
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Local correctability of expander codes
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.00 |
We present a new class of asymptotically good, linear error-correcting codes. These codes can be both encoded and decoded in linear time. They can also be encoded by logarithmic-depth circuits of linear size and decoded by logarithmic depth circuits of size O(nlogn). We present both randomized and explicit constructions of these codes