60 citations · 151 across the 27 of their papers we have counts for
8 papers · 1 filter
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…
Decoding of Lifted Affine-Invariant Codes
Lukas Holzbaur, Nikita Polyanskii
Lifted Reed-Solomon codes, a subclass of lifted affine-invariant codes, have been shown to be of high rate while preserving locality properties similar to generalized Reed-Muller c…
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…
Coding with Noiseless Feedback over the Z-channel
Christian Deppe, Vladimir Lebedev, Georg Maringer +1
In this paper, we consider encoding strategies for the Z-channel with noiseless feedback. We analyze the combinatorial setting where the maximum number of errors inflicted by an ad…
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…