scientific article; zbMATH DE number 2154117

From MaRDI portal
Publication:4664666





The concept of a binary superimposed \((s,\ell)\)-code is introduced. A set \(C\) is called a superimposed \((s,\ell)\)-code (or, briefly, \((s,\ell)\)-code) if, for every pair of sets \(S,L\subset \{1,2,\dots,t\}\) such that \(| S| =s\), \(| L| =\ell\), and \(S\cap L=\varnothing\), there exists a position \(i\in \{1,2,\dots,N\}\) such that \(x_i(j)=1\) for all \(j\in L\), and \(x_i(j^{\prime})\) for all \(j^{\prime}\in S\). Upper and lower bounds on the rate of superimposed codes are given. For the entire collection see [Zbl 0944.00096].




Cited in
(44)








This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4664666)