No label defined (Q4501023)

Let \(X=\|x_i(u)\|\), \(i=1,\dots,N\), \(u=1,\dots,t\), be a binary \((N\times t)\)-matrix (code) whose columns are codewords and let \(k=\max_{i} \sum_{u=1}^t x_i(u)\) be the maximal weight of rows. The code \(X\) is called a superimposed \((s,t)\)-design if all the Boolean sums composed of no more than \(s\) columns are distinct. An \((N\times t)\)-matrix is called a superimposed \((s,t,k)\)-design of length \(N\), size \(t\), strength \(s\), and constraint \(k\) if the code \(X\) is a superimposed \((s,t)\)-design whose maximal row weight is equal to \(k\), \(1\leq s,k<t\), \(N>1\). Let \(N(s,t,k)\) be the minimal possible length of a superimposed \((s,t,k)\)-design. It is proven that \(N(s,kq,k)=3q\), where \(q\geq k^2\), \(k\geq 4\) are integers. This result improves that of \textit{A.~G.~D'yachkov, A.~J.~Macula}, and \textit{V.~V.~Rykov} [IEEE Trans. Inf. Theory 46, No. 1, 284-290 (2000; Zbl 0999.94044)] for optimal superimposed designs. For the entire collection see [Zbl 0918.00043].