Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Shchukin, V. Yu."'
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
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
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
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/1601.06705
A binary code is said to be a disjunctive list-decoding $s_L$-code, $s\ge1$, $L\ge1$, (briefly, LD $s_L$-code) if the code is identified by the incidence matrix of a family of finite sets in which the union of any $s$ sets can cover not more than $L-
Externí odkaz:
http://arxiv.org/abs/1407.2482
Publikováno v:
Publons
In this paper, we consider symmetric disjunctive list-decoding (SLD) codes, which are a class of binary codes based on a symmetric disjunctive sum (SDS) of binary symbols. By definition, the SDS takes values from the ternary alphabet {0, 1, * }, wher
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::032f442f2664b0a00b2fc9160dfdb917
https://hal.inria.fr/hal-01275864
https://hal.inria.fr/hal-01275864
Publikováno v:
Publons
An s-subset of codewords of a binary code X is said to be (s,l)-bad in X if the code X contains a subset of other l codewords such that the conjunction of the l codewords is covered by the disjunctive sum of the s codewords. Otherwise, the s-subset o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::8ba3aca1dd2e3137761ee178f393c9f5
https://inria.hal.science/hal-01276693
https://inria.hal.science/hal-01276693