29 citations · 41 across the 14 of their papers we have counts for
4 papers · 1 filter
Almost Cover-Free Codes and Designs
Arkadii D'yachkov, Ilya Vorobyev, Nikita Polyanskii +1
An -subset of codewords of a binary code is said to be an {\em -bad} in if the code contains a subset of other codewords such that the conjunction o…
Symmetric Disjunctive List-Decoding Codes
Arkadii D'yachkov, Ilya Vorobyev, Nikita Polyanskii +1
A binary code is said to be a disjunctive list-decoding -code (LD -code), , , if the code is identified by the incidence matrix of a family of finite se…
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 -code, , , (briefly, LD -code) if the code is identified by the incidence matrix of a family of fini…
Bounds on the rate of superimposed codes
Arkady D'yachkov, Ilya Vorobyev, Nikita Polianskii +1
A binary code is called a superimposed cover-free -code if the code is identified by the incidence matrix of a family of finite sets in which no intersection of se…