2 citations · 2 across the 3 of their papers we have counts for
6 papers · 1 filter
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…
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…