1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.IT2024★ 1 cited
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…
cs.IT2023
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…