Checking computations in polylogarithmic time
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Self-testing/correcting for polynomials and for approximate functions
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Efficient probabilistically checkable proofs and applications to approximations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Self-testing/correcting with applications to numerical problems
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Improved non-approximability results
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Probabilistic checking of proofs and hardness of approximation problems
Probabilistic checking of proofs and hardness of approximation problems
Improved low-degree testing and its applications
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)
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
Robust Characterizations of Polynomials withApplications to Program Testing
SIAM Journal on Computing
Locally Testable Codes and PCPs of Almost-Linear Length
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Some 3CNF properties are hard to test
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
Algebraic testing and weight distributions of codes
Theoretical Computer Science
Some improvements to total degree tests
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Robust pcps of proximity, shorter pcps and applications to coding
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Hardness of Approximating the Shortest Vector Problem in Lattices
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Testing Polynomials over General Fields
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Testing Low-Degree Polynomials over Prime Fields
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Linearity testing in characteristic two
IEEE Transactions on Information Theory - Part 1
IEEE Transactions on Information Theory
Algebraic property testing: the role of invariance
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Breaking the ε-Soundness Bound of the Linearity Test over GF(2)
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Green's conjecture and testing linear-invariant properties
Proceedings of the forty-first annual ACM symposium on Theory of computing
List Decoding of Binary Codes---A Brief Survey of Some Recent Results
IWCC '09 Proceedings of the 2nd International Workshop on Coding and Cryptology
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
Algorithmic and Analysis Techniques in Property Testing
Foundations and Trends® in Theoretical Computer Science
Local list-decoding and testing of random linear codes from high error
Proceedings of the forty-second ACM symposium on Theory of computing
Breaking the $\epsilon$-Soundness Bound of the Linearity Test over GF(2)
SIAM Journal on Computing
Guest column: testing linear properties: some general theme
ACM SIGACT News
Symmetric LDPC codes and local testing
Property testing
Some recent results on local testing of sparse linear codes
Property testing
Symmetric LDPC codes and local testing
Property testing
Some recent results on local testing of sparse linear codes
Property testing
Characterizations of locally testable linear-and affine-invariant families
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Characterizations of locally testable linear- and affine-invariant families
Theoretical Computer Science
SIAM Journal on Discrete Mathematics
Hi-index | 0.00 |
A code is said to be locally testable if an algorithm can distinguish between a codeword and a vector being essentially far from the code using a number of queries that is independent of the code驴s length. The question of characterizing codes that are locally testable is highly complex. In this work we provide a sufficient condition for linear codes to be locally testable. Our condition is based on the weight distribution (spectrum) of the code and of its dual.Codes of (large) length n and minimum distance \frac{n}{2} - \Theta (\sqrt n ) have size which is at most polynomial in n. We call such codes almost-orthogonal. We use our condition to show that almost-orthogonal codes are locally testable, and, moreover, their dual codes can be spanned by words of constant weights (weight of a codeword refers to the number of its non-zero coordinates).