Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels

Theoretical Computer Science

Volumn 306, Issue 1-3, 2003, Pages 223-243

  De Bonis, Annalisa ^a   Vaccaro, Ugo ^a  

^a UNIVERSITY OF SALERNO   (Italy)

Author keywords

Cover free families; Group testing; Multiaccess channels; Superimposed codes

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SOFTWARE SELECTION AND EVALUATION; THEOREM PROVING; VECTORS;

MULTIACCESS CHANNELS;

BINARY CODES;

EID: 0042008122     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(03)00281-0     Document Type: Article

References (44)

1. Ateniese G., Blundo C., De Santis A., Stinson D.R. Visual cryptography for general access structures. Inform. and Comput. 129(2):1996;86-106.
2. D.J. Balding, W.J. Bruno, E. Knill, D.C. Torney, A comparative survey of non-adaptive pooling design, in: T.P. Speed, M.S. Waterman (Eds.), Genetic Mapping and DNA Sequencing, IMA Volumes in Mathematics and its Applications, Springer, Berlin, 1996, pp. 133-154.
3. Zs. Baranyai, On the factorization of the complete uniform hypergraph, in: Infinite and Finite Sets, Proc. Coll. Math. Soc. Jànos Bòlyai, Vol. 10, 1975, pp. 91-108.
4. E. Barillot, B. Lacroix, D. Cohen, Theoretical analysis of library screening using an n -dimensional pooling strategy, Nucleic Acids Res. (1991) 6241-6247.
5. Bertsekas D., Gallager R. Data Networks. 1992;Prentice-Hall, Englewood Cliffs, NJ.
6. Bruno W.J., Balding D.J., Knill E., Bruce D., Whittaker C., Dogget N., Stalling R., Torney D.C. Design of efficient pooling experiments. Genomics. 26:1995;21-30.
7. S. Chaudhuri, J. Radhakrishnan, Deterministic restrictions in circuit complexity, in: Proc. of the 28th Annu. ACM Symp. on the Theory of Computing (STOC 96), Philadelphia, PA, 1996, pp. 30-36.
8. Chen R.W., Hwang F.K. K -definite group testing and its application to polling in computer networks Congr. Numer. 47:1985;145-149.
9. B.S. Chlebus, Randomized communication in radio networks, in: P.M. Pardalos, S. Rajasekaran, J. Reif, J.D.P. Rolim (Eds.), Handbook of Randomized Computing, Vol. I, Kluwer Academic Publishers, Dordrecht, 2001, pp. 401-456.
10. B. Chor, A. Fiat, M. Naor, Tracing traitors, in: Proc. of Crypto 94, Santa Barbara, CA, Lecture Notes in Computer Science, Vol. 839, Springer, Berlin, 1994, pp. 257-270.
11. A.E.F. Clementi, A. Monti, R. Silvestri, Selective families, superimposed codes, and broadcasting on unknown radio networks, in: Proc of Symp. on Discrete Algorithms (SODA'01), Washington, DC, pp. 709-718.
12. Damaschke P. Randomized group testing for mutually obscuring defectives. Inform. Process. Lett. 67(3):1998;131-135.
13. De Bonis A., Vaccaro U. Improved algorithms for group testing with inhibitors. Inform. Process. Lett. 67:1998;57-64.
14. Dorfman R. The detection of defective members of large populations. Ann. Math. Statist. 14:1943;436-440.
15. Du D.Z., Hwang F.K. Combinatorial Group Testing and its Applications. 2nd Edition:2000;World Scientific, Singapore.
16. Dyachkov A.G., Macula A.J., Rykov V.V. New constructions of superimposed codes. IEEE Trans. Inform. Theory. 46(1):2000;284-290.
17. A.G. Dyachkov, A.J. Macula, V.V. Rykov, New applications and results of superimposed code theory arising from the potentialities of molecular biology in: Number, Information and Complexity, Kluwer, Dordrecht, 2000, pp. 265-282.
18. Dyachkov A.G., Rykov V.V. Bounds on the length of disjunctive codes. Probl. Control Inform. Theory. 11:1982;7-13.
19. Dyachkov A.G., Rykov V.V. A survey of superimposed code theory. Probl. Control Inform. Theory. 12(4):1983;1-13.
20. Dyer M., Fenner T., Frieze A., Thomason A. On key storage in secure networks. J. Cryptology. 8:1995;189-200.
21. Erdö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:1985;75-89.
22. Farach M., Kannan S., Knill E.H., Muthukrishnan S. Group testing with sequences in experimental molecular biology. Carpentieri B., De Santis A., Vaccaro U., Storer J. Proc. Compression and Complexity of Sequences 1997. 1997;357-367 IEEE Computer Society, Silver Spring, MD.
23. Füredi Z. On. r -cover-free families J. Combin. Theory Ser. A. 73:1996;172-173.
24. Hung Q. Ngo, Ding-Zhu Du, 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, American Mathematical Society, Providence, RI, 2000, pp. 171-182.
25. Hwang F.K. A tale of two coins. Amer. Math. Monthly. 94:1987;121-129.
26. Hwang F.K., Sös V.T. Non adaptive hypergeometric group testing. Studia Sc. Math. Hungarica. 22:1987;257-263.
27. P. Indyk, Deterministic superimposed coding with application to pattern matching, Proc. Foundations of Computer Science (FOCS 97), IEEE Press, Miami, FL, 1997, pp. 127-136.
28. G.O.H. Katona, T.G. Tarján, Extremal problems with excluded subgraphs in the n -cube, Graph Theory, Lagow, Poland, Lecture Notes in Mathematics, Vol. 1018, Springer, Berlin, 1983, pp. 84-93.
29. Kautz W.H., Singleton R.R. Nonrandom binary superimposed codes. IEEE Trans. Inform. Theory. 10:1964;363-377.
30. Komlós J., Greenberg A.G. An asymptotically fast non-adaptive algorithm for conflict resolution in multiple-access channels. IEEE Trans. Inform. Theory. 31(2):1985;302-306.
31. R. Kumar, S. Rajagopalan, A. Sahai, Coding constructions for blacklisting problems without computational assumptions, in: Proc. of CRYPTO '99, Santa Barbara, CA, Lecture Notes in Computer Science, Vol. 1666, Springer, Berlin, 1999, pp. 609-623.
32. Linial N. Locality in distributed graph algorithms. SIAM J. Comput. 21:1992;193-201.
33. Macula A.J. A simple construction of. d -disjunct matrices with certain constant weights Discrete Math. 162:1996;311-312.
34. e -disjunct matrices Discrete Appl. Math. 80:1997;217-222.
35. D. Margaritis, S. Skiena, Reconstructing strings from substrings in rounds, Proc. of Foundations of Computer Science (FOCS 95), Milwaukee, WI, pp. 613-620.
36. F. Meyer auf der Heide, C. Scheideler, V. Stemann, Exploiting storage redundancy to speed up randomized shared memory simulations, Proc. of the 12th Internat. Symp. on Theoretical Aspects of Computer Science (STACS 95), pp. 267-278.
37. Mitchel C.J., Piper F.C. Key storage in secure networks. Discrete Appl. Math. 21:1988;215-228.
38. Motwani R., Raghavan P. Randomized Algorithms. 1995;Cambridge University Press, Cambridge.
39. P.A. Pevzner, R. Lipshutz, Towards DNA sequencing chips, in: Proc. of the 19th Conference on Mathematical Foundations of Computer Science, Kosice, Slovakia, Lectures Notes in Computer Science, Vol. 841, Springer, Berlin, 1994, pp. 143-158.
40. Ruszinkó M. On the upper bound of the size of the. r -cover-free families J. Combin. Theory Ser. A. 66:1994;302-310.
41. Sagalovich Yu.L. Separating systems. Probl. Inform. Transmission. 30(2):1994;105-123.
42. Stinson D.R., van Trung Tran, Wei R. Secure frameproof codes, key distribution patterns, group testing algorithms and related structures. J. Statist. Plann. Inference. 86:2000;595-617.
43. Tsybakov B.S., Mikhailov V.A., Likhanov N.B. Bounds for packet transmissions rate in a random-multiple-access system. Probl. Inform. Transmission. 19:1983;61-81.
44. Yeh Hong-Gwa. d-Disjunct matrices: bounds and Lovász Local Lemma Discrete Math. 253:2002;97-107.