Showing a limited preview of this publication:
Abstract
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 nonexistence of a perfect weighing code with such parameters is proved.
Received: 2014-3-19
Published Online: 2015-4-17
Published in Print: 2015-4-1
© 2015 by Walter de Gruyter Berlin/Boston