Nikita Polyanskii

most citedAlmost Cover-Free Codes and Designs

2 citations · 3 across the 4 of their papers we have counts for

collaborators

5 papers

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…

cs.IT2022★ 1 cited

Signature Codes for a Noisy Adder Multiple Access Channel

Gökberk Erdoğan, Georg Maringer, Nikita Polyanskii

In this work, we consider $q$ -ary signature codes of length $k$ and size $n$ for a noisy adder multiple access channel. A signature code in this model has the property that any sub…

cs.IT2014★ 2 cited

Almost Cover-Free Codes and Designs

Arkadii D'yachkov, Ilya Vorobyev, Nikita Polyanskii +1

An $s$ -subset of codewords of a binary code $X$ is said to be an {\em $(s, ℓ)$ -bad} in $X$ if the code $X$ contains a subset of other $ℓ$ codewords such that the conjunction o…

cs.IT2014

Symmetric Disjunctive List-Decoding Codes

Arkadii D'yachkov, Ilya Vorobyev, Nikita Polyanskii +1

A binary code is said to be a disjunctive list-decoding $s_{L}$ -code (LD $s_{L}$ -code), $s \geq 2$ , $L \geq 1$ , if the code is identified by the incidence matrix of a family of finite se…

cs.IT2014

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 $s_{L}$ -code, $s \geq 1$ , $L \geq 1$ , (briefly, LD $s_{L}$ -code) if the code is identified by the incidence matrix of a family of fini…