Threshold Disjunctive Codes

Let 1 ≤ s < t, N ≥ 1 be integers and a complex electronic circuit of size t is said to be an s-active, s ≪ t, and can work as a system block if not more than s elements of the circuit are defective. Otherwise, the circuit is said to be an s-defective and should be substituted for the s-active circuit. Suppose that there exists a possibility to check the s-activity of the circuit using N non-adaptive group tests identified by a conventional disjunctive s-code X of size t and length N. As usually, we say that any group test yields the positive response if the group contains at least one defective element. In this case, there is no any interest to look for the defective elements. We are keen to decide on the number of the defective elements in the circuit without knowing the code X. In addition, the decision has the minimal possible complexity because it is based on the simple comparison of a fixed threshold T , 0 ≤ T ≤ N − 1, with the number of positive responses p, 0 ≤ p ≤ N , obtained after carrying out N non-adaptive tests prescribed by the disjunctive s-code X. For the introduced group testing problem, a new class of the well-known disjunctive s-codes called the threshold disjunctive s-codes is defined. The aim of our paper is to discuss both some constructions of suboptimal threshold disjunctive s-codes and the best random coding bounds on the rate of threshold disjunctive s-codes. Let N , t, s and T be integers, where 2 ≤ s < t and 0 < T < N. Let denote the equality by definition, |A| – the size of the set A and [N ] {1, 2,. .. , N } – the set of integers from 1 to N. The standard symbol ⌊a⌋ will be used to denote the largest integer ≤ a. (t) (codewords) is called a binary code of length N and size t = ⌊2 RN ⌋, where a fixed parameter R > 0 is called a rate of the code X. The number of 1's in the codeword x(j), i.e., |x (j)| N i=1 x i (j), j ∈ [t], (1) is called the weight of x(j), j ∈ [t]. A code X is called a constant weight binary code of weight w, 1 ≤ w < …