I. Vorobyev

activity

20142024

most citedBounds on the rate of superimposed codes

29 citations · 52 across the 26 of their papers we have counts for

collaborators

Showing 2014Show all

4 papers · 1 filter

cs.IT2014★ 2 cited

Almost Cover-Free Codes and Designs

Arkadii D'yachkov, Ilya Vorobyev, Nikita Polyanskii +1

An $s$ -subset of codewords of a binary code $X$ is said to be an {\em $(s, ℓ)$ -bad} in $X$ if the code $X$ contains a subset of other $ℓ$ codewords such that the conjunction o…

cs.IT2014

Symmetric Disjunctive List-Decoding Codes

Arkadii D'yachkov, Ilya Vorobyev, Nikita Polyanskii +1

A binary code is said to be a disjunctive list-decoding $s_{L}$ -code (LD $s_{L}$ -code), $s \geq 2$ , $L \geq 1$ , if the code is identified by the incidence matrix of a family of finite se…

cs.IT2014

Almost Disjunctive List-Decoding Codes

A. G. Dyachkov, I. V. Vorobyev, N. A. Polyanskii +1

A binary code is said to be a disjunctive list-decoding $s_{L}$ -code, $s \geq 1$ , $L \geq 1$ , (briefly, LD $s_{L}$ -code) if the code is identified by the incidence matrix of a family of fini…

cs.IT2014★ 29 cited

Bounds on the rate of superimposed codes

Arkady D'yachkov, Ilya Vorobyev, Nikita Polianskii +1

A binary code is called a superimposed cover-free $(s, ℓ)$ -code if the code is identified by the incidence matrix of a family of finite sets in which no intersection of $ℓ$ se…