Succinct representation of codes with applications to testing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5687 LNCS, Issue , 2009, Pages 534-547

  Grigorescu, Elena ^a   Kaufman, Tali ^a   Sudan, Madhu ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b MICROSOFT RESEARCH   (United Kingdom)

Author keywords

Affine cyclic invariance; Locally testable codes; Single orbit

Indexed keywords

AFFINE TRANSFORMATIONS; AFFINE/CYCLIC INVARIANCE; BCH CODE; BLOCK LENGTHS; CODE-WORDS; CYCLIC CODE; LINEAR ERROR-CORRECTING CODES; LOCAL CONSTRAINTS; LOCALLY TESTABLE CODES; PROPERTY-TESTING; SINGLE ORBIT; SUCCINCT REPRESENTATION; SYMMETRY GROUPS;

ARTIFICIAL INTELLIGENCE; BINARY CODES; COMBINATORIAL OPTIMIZATION; INFORMATION THEORY; ITERATIVE DECODING; ORBITS; QUANTUM THEORY; TECHNICAL PRESENTATIONS;

APPROXIMATION ALGORITHMS;

EID: 70350585348     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03685-9_40     Document Type: Conference Paper

References (18)

1. Alon, N., Kaufman, T., Krivelevich, M., Litsyn, S., Ron, D.: Testing Reed-Muller codes. IEEE Transactions on Information Theory 51(11), 4032-4039 (2005)
2. Blum, M., Luby, M., Rubinfeld, R.: Self-testing/correcting with applications to numerical problems. Journal of Computer and System Sciences 47(3), 549-595 (1993)
3. Bourgain, J.: Mordell's exponential sum estimate revisited. J. Amer. Math. Soc. 18(2), 477-499 (2005) (electronic)
4. Bourgain, J.: Some arithmetical applications of the sum-product theorems in finite fields. In: Geometric aspects of functional analysis. Lecture Notes in Math., vol. 1910, pp. 99-116. Springer, Berlin (2007)
5. Bourgain, J., Katz, N., Tao, T.: A sum-product estimate in finite fields, and applications. Geom. Funct. Anal. 14(1), 27-57 (2004)
6. Bourgain, J., Chang, M.-C.: A Gauss sum estimate in arbitrary finite fields. C. R. Math. Acad. Sci. Paris 342(9), 643-646 (2006)
7. Bourgain, J., Konyagin, S.V.: Estimates for the number of sums and products and for exponential sums over subgroups in fields of prime order. C. R. Math. Acad. Sci. Paris 337(2), 75-80 (2003)
8. Goldreich, O., Goldwasser, S., Ron, D.: Property testing and its connection to learning and approximation. JACM 45(4), 653-750 (1998)
9. Goldreich, O., Sudan, M.: Locally testable codes and PCPs of almost-linear length. J. ACM 53(4), 558-655 (2002); Preliminary version in FOCS 2002
10. Jutla, C.S., Patthak, A.C., Rudra, A., Zuckerman, D.: Testing low-degree polynomials over prime fields. In: FOCS 2004, pp. 423-432. IEEE Computer Society Press, Los Alamitos (2004)
11. Kaufman, T., Litsyn, S.: Almost orthogonal linear codes are locally testable. In: FOCS, pp. 317-326. IEEE Computer Society Press, Los Alamitos (2005)
12. Kaufman, T., Litsyn, S.: Long extended BCH codes are spanned by minimum weight words. In: Fossorier, M.P.C., Imai, H., Lin, S., Poli, A. (eds.) AAECC 2006. LNCS, vol. 3857, pp. 285-294. Springer, Heidelberg (2006)
13. Kaufman, T., Ron, D.: Testing polynomials over general fields. SIAM J. Comput. 36(3), 779-802 (2006)
14. Kaufman, T., Sudan, M.: Sparse random linear codes are locally decodable and testable. In: FOCS, pp. 590-600. IEEE Computer Society Press, Los Alamitos (2007)
15. Kaufman, T., Sudan, M.: Algebraic property testing: the role of invariance. In: Ladner, R.E., Dwork, C. (eds.) STOC, pp. 403-412. ACM Press, New York (2008)
16. MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. Elsevier/North-Holland, Amsterdam (1981)
17. Rubinfeld, R., Sudan, M.: Robust characterizations of polynomials with applications to program testing. SIAM Journal on Computing 25(2), 252-271 (1996)
18. van Lint, J.H.: Introduction to Coding Theory, 3rd edn. Graduate Texts in Mathematics, vol. 86. Springer, Berlin (1999)