29 citations · 52 across the 26 of their papers we have counts for
4 papers · 1 filter
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…
Fast Decoding of Union-free Codes
Ilya Vorobyev
Union-free codes and disjunctive codes are two combinatorial structures, which are used in nonadaptive group testing to find a set of defective elements among samples by ca…
Complete Traceability Multimedia Fingerprinting Codes Resistant to Averaging Attack and Adversarial Noise with Optimal Rate
Ilya Vorobyev
In this paper we consider complete traceability multimedia fingerprinting codes resistant to averaging attacks and adversarial noise. Recently it was shown that there are no such c…
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…