Superimposed codes for the search model of a. renyi

References

• Renyi , A. 1965 . On the theory of random search . Bull. Amer. Math. Soc. , 71 ( 6 ) : 809 – 828 .
   Web of Science ®Google Scholar
• Kautz , W. H. and Singleton , R. C. 1964 . Nonrandom binary superimposed codes . IEEE Trans. Inform. Theory , 10 ( 4 ) : 363 – 377 .
   Web of Science ®Google Scholar
• Dyachkov , A. G. and Rykov , V. V. 1982 . Bounds on the length of superimposed codes . Problemy Peredaehi Informatsii , 18 ( 3 ) : 7 – 13 . in Russian
   Google Scholar
• Dyachkov , A. G. and Rykov , V. V. 1983 . A survey of superimposed code theory . Prob. of Control and Inform. Theory , 12 ( 4 ) : 229 – 244 .
   Google Scholar
• Dyachkov , A. G. , Rykov , V. V. and Rashad , A. M. 1989 . Superimposed distance codes . Prob. of Control and Inform. Theory , 18 ( 4 ) : 223 – 250 .
   Google Scholar
• Rashad , A. M. 1990 . Random coding bounds on the rate for list-decoding superimposed codes . Problems of Control and Inform. Theory , 19 ( 2 ) in print
   Google Scholar
• Dyachkov , A. G. and Rashad , A. M. 1989 . Universal decoding for random design of screening experiments . Microelectronic and Reliability J. , 29 ( 6 ) : 965 – 971 .
   Web of Science ®Google Scholar
• Gallager , R. G. 1968 . Information theory and reliable communication , New York : Wiley .
   Google Scholar
• Rashad , A. M. 1989 . On symmetrical superimposed codes . J. Inf. Process. Cybern. Elk , 7 : 337 – 341 .
   Google Scholar