Efficiently decodable error-correcting list disjunct matrices and applications

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

Volumn 6755 LNCS, Issue PART 1, 2011, Pages 557-568

  Ngo, Hung Q ^a   Porat, Ely ^b   Rudra, Atri ^a  

^a UNIVERSITY AT BUFFALO   (United States)

^b BAR ILAN UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BLACK BOXES; BUILDING BLOCKES; COMBINATORIAL OBJECTS; DISJUNCT MATRICES; ENCODINGS; ERROR TOLERANT; EXPLICIT CONSTRUCTIONS; FALSE NEGATIVES; FALSE POSITIVE; GROUP TESTING; LOWER AND UPPER BOUNDS; MULTIPLE USER; NEW RESULTS; OPTIMAL NUMBER; STAND -ALONE; TEST ERRORS;

DECODING; OPTIMIZATION; TESTING;

MATRIX ALGEBRA;

EID: 79960023241     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22006-7_47     Document Type: Conference Paper

References (23)

1. Alon, N., Asodi, V.: Tracing many users with almost no rate penalty. IEEE Trans. Inform. Theory 53(1), 437-439 (2007)
2. Alon, N., Hod, R.: Optimal monotone encodings. IEEE Transactions on Information Theory 55(3), 1343-1353 (2009)
3. Cheraghchi, M.: Noise-resilient group testing: Limitations and constructions. In: Kutyłowski, M., Charatonik, W., Gȩbala, M. (eds.) FCT 2009. LNCS, vol. 5699, pp. 62-73. Springer, Heidelberg (2009)
4. Cormode, G., Muthukrishnan, S.: What's hot and what's not: tracking most frequent items dynamically. ACM Trans. Database Syst. 30(1), 249-278 (2005)
5. De Bonis, A., Ģasieniec, L., Vaccaro, U.: Optimal two-stage algorithms for group testing problems. SIAM J. Comput. 34(5), 1253-1270 (electronic) (2005)
6. Du, D.Z., Hwang, F.K.: Combinatorial group testing and its applications, 2nd edn. Series on Applied Mathematics, vol. 12. World Scientific Publishing Co. Inc., River Edge (2000)
7. D'yachkov, A.G., Rykov, V.V.: A survey of superimposed code theory. Problems Control Inform. Theory/Problemy Upravlen. Teor. Inform. 12(4), 229-242 (1983)
8. D'yachkov, A.G., Rykov, V.V., Rashad, A.M.: Superimposed distance codes. Problems Control Inform. Theory 18(4), 237-250 (1989)
9. Erdo{combining double acute accent}s, P., Frankl, P., Füredi, Z.: Families of finite sets in which no set is covered by the union of r others. Israel J. Math. 51(1-2), 79-89 (1985)
10. Füredi, Z.: On r-cover-free families. J. Combin. Theory Ser. A 73(1), 172-173 (1996)
11. Ganguly, S.: Data stream algorithms via expander graphs. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 52-63. Springer, Heidelberg (2008)
12. Goodrich, M.T., Atallah, M.J., Tamassia, R.: Indexing information for data forensics. In: Third International Conference on Applied Cryptography and Network Security (ANCS), pp. 206-221 (2005)
13. Indyk, P.: Explicit constructions of selectors and related combinatorial structures, with applications. In: SODA, pp. 697-704 (2002)
14. Indyk, P., Ngo, H.Q., Rudra, A.: Efficiently decodable non-adaptive group testing. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1126-1142 (2010)
15. Kainkaryam: Pooling in high-throughput drug screening. Current Opinion in Drug Discovery & Development 12(3), 339-350 (2009)
16. Khattab, S.M., Gobriel, S., Melhem, R.G., Mossé, D.: Live baiting for service-level dos attackers. In: INFOCOM, pp. 171-175 (2008)
17. Moran, T., Naor, M., Segev, G.: Deterministic history-independent strategies for storing information on write-once memories. Theory of Computing 5(1), 43-67 (2009)
18. Ngo, H.Q., Du, D.Z.: A survey on combinatorial group testing algorithms with applications to DNA library screening. In: Discrete Mathematical Problems with Medical Applications. DIMACS Ser. Discrete Math. Theoret. Comput. Sci., vol. 55, pp. 171-182. Amer. Math. Soc., Providence (2000)
19. Parvaresh, F., Vardy, A.: Correcting errors beyond the Guruswami-Sudan radius in polynomial time. In: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 285-294 (2005)
20. Porat, E., Rothschild, A.: Explicit non-adaptive combinatorial group testing schemes. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 748-759. Springer, Heidelberg (2008)
21. Rashad, A.M.: Random coding bounds on the rate for list-decoding superimposed codes. Problems Control Inform. Theory/Problemy Upravlen. Teor. Inform. 19(2), 141-149 (1990)
22. Rudra, A., Uurtamo, S.: Data stream algorithms for codeword testing. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6198, pp. 629-640. Springer, Heidelberg (2010)
23. Ruszinkó, M.: On the upper bound of the size of the r-cover-free families. J. Combin. Theory Ser. A 66(2), 302-310 (1994)