Efficiently decodable non-adaptive group testing

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2010, Pages 1126-1142

  Indyk, Piotr ^a   Ngo, Hung Q ^b   Rudra, Atri ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY AT BUFFALO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DECODING; POLYNOMIAL APPROXIMATION; REED-SOLOMON CODES; TECHNOLOGY TRANSFER;

BUILDING BLOCKES; CHARACTERISTIC VECTORS; DATA STREAM ALGORITHMS; DATA STREAM MODEL; DISJUNCT MATRICES; EFFICIENT CONSTRUCTION; NON-ADAPTIVE GROUP TESTING; POLYNOMIAL-TIME;

MATRIX ALGEBRA;

EID: 77951698314     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973075.91     Document Type: Conference Paper

References (32)

1. M. Alekhnovich. Linear diophantine equations over polynomials and soft decoding of reed-solomon codes. IEEE Transactions on Information Theory, 51(7):2257-2265, 2005. (Pubitemid 41136392)
2. N. Alon, D. Moshkovitz, and S. Safra. Algorithmic construction of sets for k-restrictions. ACM Trans. Algorithms, 2(2):153-177, 2006.
3. T. Berger, N. Mehravari, D. Towsley, and J. Wolf. Random multiple-access communications and group testing. IEEE Trans. Commun., 32(7):769-779, 1984.
4. Y. Caro and Z. Tuza. Improved lower bounds on k-independence. J. Graph Theory, 15(1):99-107, 1991.
5. H.-B. Chen and F. K. Hwang. A survey on nonadaptive group testing algorithms through the angle of decoding. J. Comb. Optim., 15(1):49-59, 2008.
6. M. Cheraghchi. Noise-resilient group testing: Limitations and constructions. In Proceedings of 17th International Symposium on Fundamentals of Computation Theory (FCT), 2009. To Appear.
7. G. Cormode and S. Muthukrishnan. What's hot and what's not: tracking most frequent items dynamically. ACM Trans. Database Syst., 30(1):249-278, 2005.
8. R. Dorfman. The detection of defective members of large populations. The Annals of Mathematical Statistics, 14(4):436-440, 1943.
9. D.-Z. Du and F. K. Hwang. Combinatorial group testing and its applications, volume 12 of Series on Applied Mathematics. World Scientific Publishing Co. Inc., River Edge, NJ, second edition, 2000.
10. A. G. Dýachkov and V. V. Rykov. Bounds on the length of disjunctive codes. Problemy Peredachi Informatsii, 18(3):7-13, 1982.
11. A. G. Dýachkov, V. V. Rykov, and A. M. Rashad. Superimposed distance codes. Problems Control Inform. Theory/Problemy Upravlen. Teor. Inform., 18(4):237-250, 1989.
12. G. Even, O. Goldreich, M. Luby, N. Nisan, and B. Veličković . Efficient approximation of product distributions. Random Structures Algorithms, 13(1):1-16, 1998.
13. Z. Füredi. On r-cover-free families. J. Comb. Theory, Ser. A, 73(1):172-173, 1996.
14. S. Ganguly. Data stream algorithms via expander graphs. In 19th International Symposium on Algorithms and Computation (ISAAC), pages 52-63, 2008.
15. M. T. Goodrich, M. J. Atallah, and R. Tamassia. Indexing information for data forensics. In Third International Conference on Applied Cryptography and Network Security (ANCS), pages 206-221, 2005.
16. V. Guruswami and P. Indyk. Linear-time list decoding in error-free settings: (extended abstract). In Proceedings of of the 31st International Colloquium on Automata, Languages and Programming (ICALP), pages 695-707, 2004.
17. V. Guruswami and A. Rudra. Concatenated codes can achieve list-decoding capacity. In Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 258-267, 2008.
18. V. Guruswami and A. Rudra. Soft decoding, dual BCH codes, and better list-decodable ∈-biased codes. In Proceedings of the 23rd Annual IEEE Conference on Computational Complexity (CCC), pages 163-174, 2008.
19. V. Guruswami, C. Umans, and S. P. Vadhan. Unbalanced expanders and randomness extractors from parvaresh-vardy codes. In Proceedings of the 22nd Annual IEEE Conference on Computational Complexity, pages 96-108, 2007.
20. W. H. Kautz and R. C. Singleton. Nonrandom binary superimposed codes. IEEE Transactions on Information Theory, 10(4):363-377, 1964.
21. A. J. Macula and L. J. Popyack. A group testing method for finding patterns in data. Discrete Appl. Math., 144(1-2):149-157, 2004.
22. H. Q. Ngo and D.-Z. Du. A survey on combinatorial group testing algorithms with applications to DNA library screening. In Discrete mathematical problems with medical applications (New Brunswick, NJ, 1999), volume 55 of DIMACS Ser. Discrete Math. Theoret. Comput. Sci., pages 171-182. Amer. Math. Soc., Providence, RI, 2000.
23. N. Nisan. Pseudorandom generators for space-bounded computation. Combinatorica, 12(4):449-461, 1992.
24. F. Parvaresh and A. Vardy. Correcting errors beyond the Guruswami-Sudan radius in polynomial time. In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, pages 285-294, 2005.
25. E. Porat and A. Rothschild. Explicit non-adaptive combinatorial group testing schemes. In Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP), pages 748-759, 2008.
26. A. Rudra. List Decoding and Property Testing of Error Correcting Codes. PhD thesis, University of Washington, 2007.
27. A. Rudra and S. Uurtamo. Data stream algorithms for codeword testing, July 2009. Manuscript.
28. H. Shachnai and A. Srinivasan. Finding large independent sets in graphs and hypergraphs. SIAM Journal on Discrete Math, 18:488-500, 2004.
29. A. Ta-Shma, C. Umans, and D. Zuckerman. Lossless condensers, unbalanced expanders, and extractors. Combinatorica, 27(2):213-240, 2007.
30. C. Thommesen. The existence of binary linear concatenated codes with Reed-Solomon outer codes which asymptotically meet the Gilbert-Varshamov bound. IEEE Transactions on Information Theory, 29(6):850-853, November 1983.
31. J. K. Wolf. Born again group testing: multiaccess communications. IEEE Transaction on Information Theory, IT-31:185-191, 1985.
32. D. Zuckerman. Linear degree extractors and the inapproximability of max clique and chromatic number. Theory of Computing, 3(1):103-128, 2007.