Weighing algorithms of classification and identification of situations

The paper gives lower bounds for the minimum number $m$ of weighings that are necessary for identification of up to $t$ non-standard objects out of the total number of $n$ objects being tested. For the problem with fixed deviation of weights of non-standard objects we construct a perfect algorithms with parameters $n=11$, $m=5$, $t=2$ corresponding to the parameters of the ternary Virtakallio–Golay code. The non-existence of a perfect weighing code with such parameters is proved.