Zobrazeno 1 - 10
of 458
pro vyhledávání: '"Shchukin, V. A."'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Shchukin, V. G.1 (AUTHOR), Konstantinov, V. O.1 (AUTHOR) konstantinov@itp.nsc.ru
Publikováno v:
Journal of Applied Mechanics & Technical Physics. Oct2023, Vol. 64 Issue 5, p767-771. 5p.
The conventional model of disjunctive group testing assumes that there are several defective elements (or defectives) among a large population, and a group test yields the positive response if and only if the testing group contains at least one defec
Externí odkaz:
http://arxiv.org/abs/1701.06201
A binary matrix is called an s-separable code for the disjunctive multiple-access channel (disj-MAC) if Boolean sums of sets of s columns are all distinct. The well-known issue of the combinatorial coding theory is to obtain upper and lower bounds on
Externí odkaz:
http://arxiv.org/abs/1701.06085
Group testing is a well known search problem that consists in detecting up to $s$ defective elements of the set $[t]=\{1,\ldots,t\}$ by carrying out tests on properly chosen subsets of $[t]$. In classical group testing the goal is to find all defecti
Externí odkaz:
http://arxiv.org/abs/1607.00511
Learning a hidden hypergraph is a natural generalization of the classical group testing problem that consists in detecting unknown hypergraph $H_{un}=H(V,E)$ by carrying out edge-detecting tests. In the given paper we focus our attention only on a sp
Externí odkaz:
http://arxiv.org/abs/1607.00507
Let $1 \le s < t$, $N \ge 1$ be integers and a complex electronic circuit of size $t$ is said to be an $s$-active, $\; s \ll t$, and can work as a system block if not more than $s$ elements of the circuit are defective. Otherwise, the circuit is said
Externí odkaz:
http://arxiv.org/abs/1607.00502
We give a method of constructing a cover-free $(s, \ell)$-code. For $k > s$, our construction yields a $ {{n \choose s} \choose \ell}\times {n \choose k}$ cover-free $(s, \ell)$-code with a constant column weight.
Comment: 2 pages
Comment: 2 pages
Externí odkaz:
http://arxiv.org/abs/1605.06847
A binary code is called a superimposed cover-free $(s,\ell)$-code if the code is identified by the incidence matrix of a family of finite sets in which no intersection of $\ell$ sets is covered by the union of $s$ others. A binary code is called a su
Externí odkaz:
http://arxiv.org/abs/1605.05363
Let $1 \le s < t$, $N \ge 1$ be integers and a complex electronic circuit of size $t$ is said to be an $s$-active, $\; s \ll t$, and can work as a system block if not more than $s$ elements of the circuit are defective. Otherwise, the circuit is said
Externí odkaz:
http://arxiv.org/abs/1601.06709