Limitation on the rate of families of locally testable codes

Authors:
Eli Ben-Sasson
Affiliations:
Computer Science Department, Technion - Israel Institute of Technology, Haifa, Israel
Venue:
Property testing
Year:
2010

Citing 35
Cited 1

Self-testing/correcting with applications to numerical problems

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Checking computations in polylogarithmic time

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
A note on efficient zero-knowledge proofs and arguments (extended abstract)

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Probabilistic checking of proofs: a new characterization of NP

Journal of the ACM (JACM)
Proof verification and the hardness of approximation problems

Journal of the ACM (JACM)
Free Bits, PCPs, and Nonapproximability---Towards Tight Results

SIAM Journal on Computing
Property testing and its connection to learning and approximation

Journal of the ACM (JACM)
Computationally Sound Proofs

SIAM Journal on Computing
Computationally efficient error-correcting codes and holographic proofs

Computationally efficient error-correcting codes and holographic proofs
Some 3CNF Properties Are Hard to Test

SIAM Journal on Computing
Robust locally testable codes and products of codes

Random Structures & Algorithms
The PCP theorem by gap amplification

Journal of the ACM (JACM)
Testing Polynomials over General Fields

SIAM Journal on Computing
Low-degree tests at large distances

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding

SIAM Journal on Computing
Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem

SIAM Journal on Computing
Sparse Random Linear Codes are Locally Decodable and Testable

FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Algebraic property testing: the role of invariance

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
2-Transitivity Is Insufficient for Local Testability

CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
Sound 3-Query PCPPs Are Long

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Locally Testable Codes Require Redundant Testers

CCC '09 Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity
Succinct Representation of Codes with Applications to Testing

APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Universal Arguments and their Applications

SIAM Journal on Computing
Combinatorial Construction of Locally Testable Codes

SIAM Journal on Computing
Composition of Low-Error 2-Query PCPs Using Decodable PCPs

FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Two-query PCP with subconstant error

Journal of the ACM (JACM)
Local list-decoding and testing of random linear codes from high error

Proceedings of the forty-second ACM symposium on Theory of computing
Low rate is insufficient for local testability

APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Locally testable vs. locally decodable codes

APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
On 2-query codeword testing with near-perfect completeness

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Expander codes

IEEE Transactions on Information Theory - Part 1
Linearity testing in characteristic two

IEEE Transactions on Information Theory - Part 1
Locally testable cyclic codes

IEEE Transactions on Information Theory
Testing Reed-Muller codes

IEEE Transactions on Information Theory

Locally testable codes and cayley graphs

Proceedings of the 5th conference on Innovations in theoretical computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes recent results which revolve around the question of the rate attainable by families of error correcting codes that are locally testable. Emphasis is placed on motivating the problem of proving upper bounds on the rate of these codes and a number of interesting open questions for future research are suggested.