The synthesis of probability tests with a small number of kits
S. V. Yarmolik, Vyacheslav N. Yarmolik · Automatic Control and Computer Sciences · 2011
In the present paper, the analysis of controlled probability tests is carried out and the basic criteria for their synthesis, including the Hamming and Cartesian distance, are given. The identity of the synthesis procedures of the controlled probability tests based on the greedy algorithm is shown, and the optimum probability test synthesized according to the given algorithm is given. A universal characteristic of the efficiency of the probability tests used for the synthesis of tests with a small number of kits is proposed. An algorithm of the synthesis of such tests is considered, and examples of such tests with the assessment of their efficiency are presented.