Optimal superimposed codes and designs for Renyi's search model

Journal of Statistical Planning and Inference

Volumn 100, Issue 2, 2002, Pages 281-302

  D'yachkov, Arkadii G ^a   Rykov, Vyacheslav V ^a  

^a MOSCOW STATE UNIVERSITY   (Russian Federation)

Author keywords

Binary superimposed code; Boolean sum; Combinatorial group testing; Perfect hash function

Indexed keywords

EID: 33747309053     PISSN: 03783758     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0378-3758(01)00140-9     Document Type: Article

References (8)

1. Du, D.-Z., Hwang, F.K., 1993. Combinatorial Group Testing and its Applications. World Scientific, Singapore, New Jersey, London, Hong Kong.
2. D'yachkov, A.G., Rykov, V.V., 1983. A survey of superimposed code theory. Problems Control Inform. Theory 12 (4), 229-242.
3. Ekhanin, S.M., 1998. Some new constructions of optimal superimposed designs. Proc. of the 6-th International Workshop "Algebraic and Combinatorial Coding Theory", ACCT-6, Pskov, Russia, 232-235.
4. Fridman, M.L., Komlos, J., 1984. On the size of separating systems and families of perfect hash functions. SIAM J. Algebraic Discrete Methods 5, 538-544.
5. Katona, G., 1966. On separating system of a finite set. J. Combin. Theory 1 (2), 174-194.
6. Kautz, W.H., Singleton, R.C., 1964. Nonrandom binary superimposed codes. IEEE Trans. Inform. Theory 10 (4), 363-377.
7. Macula, A.J., 1996. A simple construction of d-disjunct matrices with certain constant weights. Discrete Math. 162, 311-312.
8. Renyi, A., 1965. On the theory of random search. Bull. Amer. Math. Soc. 71 (6), 809-828.