Superimposed codes for the search model of a. renyi

Abstract

In 1965 A. Renyi [1] demonstrated in his Landmark paper the mathematical model of random search. In this work we will study a generalized and modified model of Renyi. We will deduce the correspondence definitions of superimposed code for Renyi's model, and obtain lower and upper bounds for the optimal length of superimposed code

Keywords:

• Discrete mathematics
• random search
• superimposed code