Nikita Polyanskii
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
25
Venues
5
Active years
2011–2025
Best venue rank
A*
Where they publish
Papers
25 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2025 | ISIT | Combinatorial Group Testing With Adversarial Deletions. | Haodong Yang, Venkata Gandikota, Nikita Polyanskii |
| 2023 | ISIT | Codes Correcting a Single Long Duplication Error. | Daniil Goshkoder, Nikita Polyanskii, Ilya Vorobyev |
| 2022 | ISIT | List-Decodable Zero-Rate Codes for the Z-Channel. | Nikita Polyanskii, Yihan Zhang |
| 2022 | ITW | Signature Codes for a Noisy Adder Multiple Access Channel. | Gkberk Erdogan, Georg Maringer, Nikita Polyanskii |
| 2021 | ISIT | Optimal Codes Correcting Localized Deletions. | Rawad Bitar, Serge Kas Hanna, Nikita Polyanskii, Ilya Vorobyev |
| 2021 | ISIT | Two-Stage Coding over the Z-Channel. | Nikita Polyanskii |
| 2021 | ISIT | On Multiple-Deletion Multiple-Substitution Correcting Codes. | Wentu Song, Nikita Polyanskii, Kui Cai, Xuan He |
| 2021 | ISIT | On Codes for the Noisy Substring Channel. | Yonatan Yehezkeally, Nikita Polyanskii |
| 2020 | COCOON | Coding with Noiseless Feedback over the Z-Channel. | Christian Deppe, Vladimir S. Lebedev, Georg Maringer, Nikita Polyanskii |
| 2020 | ISIT | Lifted Reed-Solomon Codes with Application to Batch Codes. | Lukas Holzbaur, Rina Polyanskaya, Nikita Polyanskii, Ilya Vorobyev |
| 2020 | ISIT | Optimal Codes Correcting a Burst of Deletions of Variable Length. | Andreas Lenz, Nikita Polyanskii |
| 2020 | ISIT | Duplication with transposition distance to the root for q-ary strings. | Nikita Polyanskii, Ilya Vorobyev |
| 2020 | ITW | Decoding of Lifted Affine-Invariant Codes. | Lukas Holzbaur, Nikita Polyanskii |
| 2020 | ITW | On Lifted Multiplicity Codes. | Lukas Holzbaur, Rina Polyanskaya, Nikita Polyanskii, Ilya Vorobyev, Eitan Yaakobi |
| 2020 | ITW | Feedback Insertion-Deletion Codes. | Georg Maringer, Nikita Polyanskii, Ilya Vorobyev, Lorenz Welter |
| 2019 | ISIT | Constructions of Batch Codes via Finite Geometry. | Nikita Polyanskii, Ilya Vorobyev |
| 2019 | Redundancy | Batch codes based on lifted multiplicity codes. | Rina Polyanskaya, Nikita Polyanskii |
| 2019 | Redundancy | Trivariate Lifted Codes with Disjoint Repair Groups. | Nikita Polyanskii, Ilya Vorobyev |
| 2019 | SODA | How to guess an n-digit number. | Zilin Jiang, Nikita Polyanskii |
| 2018 | ISIT | Separable Codes for the Symmetric Multiple-Access Channel. | Arkadii G. D'yachkov, Nikita Polyanskii, Vladislav Yu. Shchukin, Ilya Vorobyev |
| 2017 | ISIT | Hypothesis test for upper bound on the size of random defective set. | Arkadii G. D'yachkov, Ilya Vorobyev, Nikita Polyanskii, Vladislav Yu. Shchukin |
| 2015 | ISIT | Symmetric disjunctive list-decoding codes. | Arkady G. D'yachkov, Ilya V. Vorobyev, Nikita Polyanskii, Vladislav Yu. Shchukin |
| 2015 | ISIT | Cover-free codes and separating system codes. | Arkady G. D'yachkov, Ilya V. Vorobyev, Nikita Polyanskii, Vladislav Yu. Shchukin |
| 2015 | ISIT | Almost cover-free codes and designs. | Arkady G. D'yachkov, Ilya V. Vorobyev, Nikita Polyanskii, Vladislav Yu. Shchukin |
| 2011 | ISIT | DNA codes for generalized stem similarity. | Arkadii G. D'yachkov, Julia Volkova, Nikita Polyanskii |