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
Chinese remaindering with errors
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Ordered Binary Decision Diagrams and Minimal Trellises
IEEE Transactions on Computers
Loss-less condensers, unbalanced expanders, and extractors
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
STOC '01 Proceedings of the thirty-third 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
Expansion of product replacement graphs
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
An introduction to low-density parity-check codes
Theoretical aspects of computer science
AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
A High Girth Graph Construction and a Lower Bound for Hitting Set Size for Combinatorial Rectangles
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical 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]
A Simple Soft-Input/Soft-Output Decoder for Hamming Codes
Proceedings of the 8th IMA International Conference on Cryptography and Coding
Exponential lower bound for 2-query locally decodable codes via a quantum argument
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Randomness-efficient low degree tests and short PCPs via epsilon-biased sets
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Computer algebra handbook
European Journal of Combinatorics
The Bloomier filter: an efficient data structure for static support lookup tables
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Batch codes and their applications
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
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
Exponential lower bound for 2-query locally decodable codes via a quantum argument
Journal of Computer and System Sciences - Special issue: STOC 2003
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
The PCP theorem by gap amplification
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
An optimal lower bound for 2-query locally decodable linear codes
Information Processing Letters
Lower bounds for adaptive locally decodable codes
Random Structures & Algorithms
LDPC codes generated by conics in the classical projective plane
Designs, Codes and Cryptography
Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles
Designs, Codes and Cryptography
The PCP theorem by gap amplification
Journal of the ACM (JACM)
EURASIP Journal on Applied Signal Processing
On the Expansion of the Giant Component in Percolated (n, d,λ) Graphs
Combinatorics, Probability and Computing
Algorithmic results in list decoding
Foundations and Trends® in Theoretical Computer Science
Computation of best possible low degree expanders
Discrete Applied Mathematics
Concatenated codes can achieve list-decoding capacity
Proceedings of the nineteenth 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
From High Girth Graphs to Hard Instances
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
ICMCTA '08 Proceedings of the 2nd international Castle meeting on Coding Theory and Applications
Message passing algorithms and improved LP decoding
Proceedings of the forty-first annual ACM symposium on Theory of computing
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
Instanton-based techniques for analysis and reduction of error floors of LDPC codes
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
Group-theoretic analysis of Cayley-graph-based cycle GF(2p) codes
IEEE Transactions on Communications
Reversible low-density parity-check codes
IEEE Transactions on Information Theory
Error-correction capability of column-weight-three LDPC codes
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Guessing facets: polytope structure and improved LP decoder
IEEE Transactions on Information Theory
Efficient and robust compressed sensing using optimized expander graphs
IEEE Transactions on Information Theory
Low Density Parity Check Code for the Single Carrier Frequency Division Multiple Access
FGIT '09 Proceedings of the 1st International Conference on Future Generation Information Technology
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
Variable length lossy coding using an LDPC code
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
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
An optimal lower bound for 2-query locally decodable linear codes
Information Processing Letters
Some low-density parity-check codes derived from finite geometries
Designs, Codes and Cryptography
Iterative approximate linear programming decoding of LDPC codes with linear complexity
IEEE Transactions on Information Theory
Two bit-flipping decoding algorithms for low-density parity-check codes
IEEE Transactions on Communications
Minimum distance and pseudodistance lower bounds for generalised LDPC codes
International Journal of Information and Coding Theory
AAECC'03 Proceedings of the 15th international conference on Applied algebra, algebraic algorithms and error-correcting codes
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
LP decoding meets LP decoding: a connection between channel coding and compressed sensing
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
A locally encodable and decodable compressed data structure
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
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
Structure, property, and design of nonbinary regular cycle codes
IEEE Transactions on Communications
Woven graph codes: asymptotic performances and examples
IEEE Transactions on Information Theory
Analysis of absorbing sets and fully absorbing sets of array-based LDPC codes
IEEE Transactions on Information Theory
Braided convolutional codes: a new class of turbo-like codes
IEEE Transactions on Information Theory
Error correction capability of column-weight-three LDPC codes under the Gallager A algorithm-Part II
IEEE Transactions on Information Theory
Dense error correction via l1-minimization
IEEE Transactions on Information Theory
The existence of concatenated codes list-decodable up to the hamming bound
IEEE Transactions on Information Theory
Algorithms and theory of computation handbook
Public-key encryption with efficient amortized updates
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
A quadratic lower bound for three-query linear locally decodable codes over any field
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Fault secure encoder and decoder for nanomemory applications
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Limitation on the rate of families of locally testable codes
Property testing
Symmetric LDPC codes and local testing
Property testing
Limitation on the rate of families of locally testable codes
Property testing
Symmetric LDPC codes and local testing
Property testing
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
Towards deterministic tree code constructions
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Compressed matrix multiplication
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
On iterative compressed sensing reconstruction of sparse non-negative vectors
Proceedings of the 4th International Symposium on Applied Sciences in Biomedical and Communication Technologies
Bounds on the minimum code distance for nonbinary codes based on bipartite graphs
Problems of Information Transmission
Tolerant locally testable codes
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Error correction in the bounded storage model
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Deterministic polynomial-time algorithms for designing short DNA words
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Some heuristic analysis of local search algorithms for SAT problems
SAGA'05 Proceedings of the Third international conference on StochasticAlgorithms: foundations and applications
Edge transitive ramanujan graphs and symmetric LDPC good codes
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Waters signatures with optimal security reduction
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Efficient and reliable low-power backscatter networks
Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
Efficient and reliable low-power backscatter networks
ACM SIGCOMM Computer Communication Review - Special october issue SIGCOMM '12
Compressed sensing construction of spectrum map for routing in cognitive radio networks
Wireless Communications & Mobile Computing
Sparse extractor families for all the entropy
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases
Problems of Information Transmission
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
LP decoding of codes with expansion parameter above 2/3
Information Processing Letters
Compressed matrix multiplication
ACM Transactions on Computation Theory (TOCT) - Special issue on innovations in theoretical computer science 2012
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
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.79 |
Using expander graphs, we construct a new family of asymptotically good, linear error-correcting codes. These codes have linear time sequential decoding algorithms and logarithmic time parallel decoding algorithms that use a linear number of processors. We present both randomized and explicit constructions of these codes. Experimental results demonstrate the good performance of the randomly chosen codes