3 citations · 3 across the 5 of their papers we have counts for
16 papers · 1 filter
Note on generalized group testing
Ilya Vorobyev
In this note, we present a new adaptive algorithm for generalized group testing, which is asymptotically optimal if , is a set of potentially contaminated sets,…
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…
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…
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…
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…