Data stream algorithms for codeword testing

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

Volumn 6198 LNCS, Issue PART 1, 2010, Pages 629-640

  Rudra, Atri ^a   Uurtamo, Steve ^a  

^a State University of New York   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BLOCK LENGTHS; CODEWORD; DATA STREAM ALGORITHMS; EXPANDER CODES; GOOD CODE; GROUP TESTING; LIST DECODABILITY; LOG SPACE; ONE-PASS; PROPERTY-TESTING; REED-SOLOMON; RS CODES; SPACE ALGORITHMS; SPACE DATA; SPACE REQUIREMENTS; STORAGE SYSTEMS; UPPER BOUND; WORST-CASE ERRORS;

ALGORITHMS; ASYMPTOTIC ANALYSIS; DATA COMMUNICATION SYSTEMS; HAMMING DISTANCE; HYDRAULICS; LINGUISTICS; RANDOM ERRORS; RAPID SOLIDIFICATION; TRANSLATION (LANGUAGES);

ERROR DETECTION;

EID: 77955339338     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14165-2_53     Document Type: Conference Paper

References (19)

1. Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. J. ACM 45 (3), 501-555 (1998)
2. Arora, S., Safra, S.: Probabilistic checking of proofs: A new characterization of NP. J. ACM 45 (1), 70-122 (1998)
3. Aspnes, J., Blais, E., Demirbas, M., O'Donnell, R., Rudra, A., Uurtamo, S.: k+ decision trees (2010) (manuscript)
4. Bellare, M., Rompel, J.: Randomness-efficient oblivious sampling. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (FOCS), pp. 276-287 (1994)
5. Ben-Sasson, E., Guruswami, V., Kaufman, T., Sudan, M., Viderman, M.: Locally testable codes require redundant testers. In: IEEE Conference on Computational Complexity, pp. 52-61 (2009)
6. Ben-Sasson, E., Harsha, P., Raskhodnikova, S.: Some 3cnf properties are hard to test. SIAM J. Comput. 35 (1), 1-21 (2005)
7. Chen, C. L., Hsiao, M. Y.: Error-correcting codes for semiconductor memory applications: A state-of-the-art review. IBM Journal of Research and Development 28 (2), 124-134 (1984)
8. Chen, P. M., Lee, E. K., Gibson, G. A., Katz, R. H., Patterson, D. A.: RAID: Highperformance, reliable secondary storage. ACM Computing Surveys 26 (2), 145-185 (1994)
9. Dinur, I.: The PCP theorem by gap amplification. J. ACM 54 (3), 12 (2007)
10. Du, D.-Z., Hwang, F. K.: Combinatorial Group Testing and its Applications. World Scientific, Singapore (2000)
11. Elerath, J.: Hard-disk drives: The good, the bad, and the ugly. Communications of the ACM 52 (6), 38-45 (2009)
12. Füredi, Z.: On r-cover-free families. J. Comb. Theory, Ser. A 73 (1), 172-173 (1996)
13. Guruswami, V., Rudra, A.: Tolerant locally testable codes. In: Chekuri, C., Jansen, K., Rolim, J. D. P., Trevisan, L. (eds.) APPROX 2005 and RANDOM 2005. LNCS, vol. 3624, pp. 306-317. Springer, Heidelberg (2005)
14. Guruswami, V., Rudra, A.: Explicit codes achieving list decoding capacity: Errorcorrection up to the Singleton bound. IEEE Transactions on Information Theory 54 (1), 135-150 (2008)
15. Indyk, P., Ngo, H. Q., Rudra, A.: Efficiently decodable non-adaptive group testing. In: Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1126-1142 (2010)
16. Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)
17. Rudra, A., Uurtamo, S.: Data stream algorithms for codeword testing. arXiv:1004.4601 [cs. IT] (2010)
18. Rudra, A., Uurtamo, S.: Two theorems in list decoding. ECCC Technical Report TR10-007 (2010)
19. Spielman, D.: Linear-time encodable and decodable error-correcting codes. IEEE Transactions on Information Theory 42 (6), 1723-1732 (1996)