60 citations · 151 across the 27 of their papers we have counts for
33 papers · 1 filter
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…
Combinatorial Group Testing in Presence of Deletions
Venkata Gandikota, Nikita Polyanskii, Haodong Yang
The study in group testing aims to develop strategies to identify a small set of defective items among a large population using a few pooled tests. The established techniques have…
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…
Signature Codes for a Noisy Adder Multiple Access Channel
Gökberk Erdoğan, Georg Maringer, Nikita Polyanskii
In this work, we consider -ary signature codes of length and size for a noisy adder multiple access channel. A signature code in this model has the property that any sub…
Lifted Reed-Solomon Codes and Lifted Multiplicity Codes
Lukas Holzbaur, Rina Polyanskaya, Nikita Polyanskii +2
Lifted Reed-Solomon and multiplicity codes are classes of codes, constructed from specific sets of -variate polynomials. These codes allow for the design of high-rate codes that…
Quadratic-Curve-Lifted Reed-Solomon Codes
Hedongliang Liu, Lukas Holzbaur, Nikita Polyanskii +2
Lifted codes are a class of evaluation codes attracting more attention due to good locality and intermediate availability. In this work we introduce and study quadratic-curve-lifte…