On optimal parameters of a class of superimposed codes and designs

Author

D´yachkov, A.G. ; Macula, Anthony J. ; Rykov, Vyacheslav V.

Author_Institution

Dept. of Probability Theory, Moscow State Univ., Russia

fYear

1998

fDate

16-21 Aug 1998

Firstpage

363

Abstract

In 1965, Renyi suggested a combinatorial group testing model, in which the size of a testing group was restricted. In this model, Renyi considered the search of one defective element (significant factor) from the finite set of elements (factors). The corresponding optimal search designs were obtained by Katona (1966). We study Renyi´s search model of several significant factors. This problem is closely related to the concept of binary superimposed codes, which were introduced by Kautz-Singleton (1964) and were investigated by D´yachkov-Rykov (1983). Our goal is to prove a lower bound on the search length and to construct the optimal superimposed codes and search designs

Keywords

binary codes; group theory; optimisation; parameter estimation; search problems; Renyi´s search model; binary superimposed codes; combinatorial group testing model; defective element; lower bound; optimal parameters; optimal search design; optimal superimposed codes; search length; significant factor; testing group size; Educational institutions; Mathematical model; Mathematics; Testing;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on

Conference_Location

Cambridge, MA

Print_ISBN

0-7803-5000-6

Type

conf

DOI

10.1109/ISIT.1998.708968

Filename

708968