29 citations · 52 across the 26 of their papers we have counts for
7 papers · 1 filter
Wiener index and graphs, almost half of whose vertices satisfy Šoltés property
Margarita Akhmejanova, Konstantin Olmezov, Aleksei Volostnov +3
The Wiener index of a connected graph is a sum of distances between all pairs of vertices of . In 1991, Šoltés formulated the problem of finding all graphs such t…
Feedback Insertion-Deletion Codes
Georg Maringer, Nikita Polyanskii, Ilya Vorobyev +1
In this paper, a new problem of transmitting information over the adversarial insertion-deletion channel with feedback is introduced. Suppose that the encoder transmits binary…
Lifted Multiplicity Codes
Lukas Holzbaur, Rina Polyanskaya, Nikita Polyanskii +2
Lifted Reed-Solomon codes and multiplicity codes are two classes of evaluation codes that allow for the design of high-rate codes that can recover every codeword or information sym…
Almost Affinely Disjoint Subspaces
Hedongliang Liu, Nikita Polyanskii, Ilya Vorobyev +1
In this work, we introduce a natural notion concerning finite vector spaces. A family of -dimensional subspaces of , which forms a partial spread, is called almo…
Lifted Reed-Solomon Codes with Application to Batch Codes
Lukas Holzbaur, Rina Polyanskaya, Nikita Polyanskii +1
Guo, Kopparty and Sudan have initiated the study of error-correcting codes derived by lifting of affine-invariant codes. Lifted Reed-Solomon (RS) codes are defined as the evaluatio…
Duplication with transposition distance to the root for -ary strings
Nikita Polyanskii, Ilya Vorobyev
We study the duplication with transposition distance between strings of length over a -ary alphabet and their roots. In other words, we investigate the number of duplication…