60 citations · 151 across the 27 of their papers we have counts for
5 papers · 2 filters
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…
Optimal Codes Correcting Localized Deletions
Rawad Bitar, Serge Kas Hanna, Nikita Polyanskii +1
We consider the problem of constructing codes that can correct deletions that are localized within a certain part of the codeword that is unknown a priori. Namely, the model that w…
Codes for the Z-channel
Nikita Polyanskii, Yihan Zhang
This paper is a collection of results on combinatorial properties of codes for the Z-channel. A Z-channel with error fraction takes as input a length- binary codeword and in…
On Codes for the Noisy Substring Channel
Yonatan Yehezkeally, Nikita Polyanskii
We consider the problem of coding for the substring channel, in which information strings are observed only through their (multisets of) substrings. Due to existing DNA sequencing…