29 citations · 52 across the 26 of their papers we have counts for
36 papers
Improved Probabilistic Lower Bounds for Separable Matrices
Daniil Goshkoder, Nikita Polyanskii, Ilya Vorobyev
This work focuses on non-adaptive combinatorial group testing, with a primary goal of efficiently identifying a set of at most defective elements among a given set of eleme…
Correcting One Error in Non-Binary Channels with Feedback
Ilya Vorobyev, Vladimir Lebedev, Alexey Lebedev
In this paper, the problem of correction of a single error in -ary symmetric channel with noiseless feedback is considered. We propose an algorithm to construct codes with feedb…
Codes Correcting a Single Long Duplication Error
Daniil Goshkoder, Nikita Polyanskii, Ilya Vorobyev
We consider the problem of constructing a code capable of correcting a single long tandem duplication error of variable length. As the main contribution of this paper, we present a…
Secure Codes with List Decoding
Yujie Gu, Ilya Vorobyev, Ying Miao
In this paper we consider combinatorial secure codes in traitor tracing for protecting copyright of multimedia content. First, we introduce a new notion of secure codes with list d…
Correcting one error in channels with feedback
Ilya Vorobyev, Alexey Lebedev, Vladimir Lebedev +1
We address the problem of correcting a single error in an arbitrary discrete memoryless channel with error-free instantaneous feedback. For the case of a one-time feedback, we prop…
Note on generalized group testing
Ilya Vorobyev
In this note, we present a new adaptive algorithm for generalized group testing, which is asymptotically optimal if , is a set of potentially contaminated sets,…