Ilya Vorobyev

Publication Activity (10 Years)

Years Active: 2014-2024
Publications (10 Years): 56

Top Topics

Hypothesis Test

Top Venues

IEEE Trans. Inf. Theory

Des. Codes Cryptogr.

Publications

Ilya Vorobyev, Christian Deppe, Holger Boche
Deterministic Identification Codes for Fading Channels. CoRR (2024)
Daniil Goshkoder, Nikita Polyanskii, Ilya Vorobyev
Efficient Combinatorial Group Testing: Bridging the Gap between Union-Free and Disjunctive Codes. CoRR (2024)
Yujie Gu, Ilya Vorobyev, Ying Miao
Secure Codes With List Decoding. IEEE Trans. Inf. Theory 70 (4) (2024)
Daniil Goshkoder, Nikita Polyanskii, Ilya Vorobyev
Codes Correcting Long Duplication Errors. IEEE Trans. Mol. Biol. Multi Scale Commun. 10 (2) (2024)
Ilya Vorobyev
Complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise with optimal rate. Des. Codes Cryptogr. 91 (4) (2023)
Daniil Goshkoder, Nikita Polyanskii, Ilya Vorobyev
Codes Correcting a Single Long Duplication Error. CoRR (2023)
Ilya Vorobyev, Vladimir S. Lebedev, Alexey V. Lebedev
Correcting One Error in Non-Binary Channels with Feedback. ISIT (2023)
Yujie Gu, Ilya Vorobyev, Ying Miao
Secure Codes with List Decoding. CoRR (2023)
Daniil Goshkoder, Nikita Polyanskii, Ilya Vorobyev
Codes Correcting a Single Long Duplication Error. ISIT (2023)
Margarita Akhmejanova, Konstantin Olmezov, Aleksei Volostnov, Ilya Vorobyev, Konstantin V. Vorob'ev, Yury Yarovikov
Wiener index and graphs, almost half of whose vertices satisfy Šoltés property. Discret. Appl. Math. 325 (2023)
Ilya Vorobyev, Alexey S. Lebedev, Vladimir Lebedev, Christian Deppe
Correcting one error in channels with feedback. CoRR (2023)
Ilya Vorobyev, Vladimir Lebedev, Alexey V. Lebedev
Correcting One Error in Non-Binary Channels with Feedback. CoRR (2023)
Alexey Lebedev, Ilya Vorobyev, Vladimir S. Lebedev, Christian Deppe
Non-adaptive and two-stage coding over the Z-channel. CoRR (2022)
Yujie Gu, Ilya Vorobyev, Ying Miao
Secure codes with list decoding. ISIT (2022)
Ilya Vorobyev
Note on generalized group testing. CoRR (2022)
Ilya Vorobyev
Complete Traceability Multimedia Fingerprinting Codes Resistant to Averaging Attack and Adversarial Noise with Optimal Rate. CoRR (2021)
Rawad Bitar, Serge Kas Hanna, Nikita Polyanskii, Ilya Vorobyev
Optimal Codes Correcting Localized Deletions. ISIT (2021)
Ilya Vorobyev
Fast Decoding of Union-Free Codes. REDUNDANCY (2021)
Lukas Holzbaur, Rina Polyanskaya, Nikita Polyanskii, Ilya Vorobyev, Eitan Yaakobi
Lifted Reed-Solomon Codes and Lifted Multiplicity Codes. CoRR (2021)
Rawad Bitar, Serge Kas Hanna, Nikita Polyanskii, Ilya Vorobyev
Optimal Codes Correcting Localized Deletions. CoRR (2021)
Ilya Vorobyev
Fast Decoding of Union-free Codes. CoRR (2021)
Hedongliang Liu, Nikita Polianskii, Ilya Vorobyev, Antonia Wachter-Zeh
Almost affinely disjoint subspaces. Finite Fields Their Appl. 75 (2021)
Lukas Holzbaur, Rina Polyanskaya, Nikita Polyanskii, Ilya Vorobyev, Eitan Yaakobi
Lifted Reed-Solomon Codes and Lifted Multiplicity Codes. IEEE Trans. Inf. Theory 67 (12) (2021)
Rina Polyanskaya, Nikita Polyanskii, Ilya Vorobyev
Binary Batch Codes With Improved Redundancy. IEEE Trans. Inf. Theory 66 (12) (2020)
Georg Maringer, Nikita Polyanskii, Ilya Vorobyev, Lorenz Welter
Feedback Insertion-Deletion Codes. ITW (2020)
Nikita Polyanskii, Ilya Vorobyev
Duplication with transposition distance to the root for $q$-ary strings. CoRR (2020)
Lukas Holzbaur, Rina Polyanskaya, Nikita Polyanskii, Ilya Vorobyev
Lifted Reed-Solomon Codes with Application to Batch Codes. ISIT (2020)
Nikita Polyanskii, Ilya Vorobyev
Duplication with transposition distance to the root for q-ary strings. ISIT (2020)
Lukas Holzbaur, Rina Polyanskaya, Nikita Polyanskii, Ilya Vorobyev
Lifted Reed-Solomon Codes with Application to Batch Codes. CoRR (2020)
Hedongliang Liu, Nikita Polyanskii, Ilya Vorobyev, Antonia Wachter-Zeh
Almost Affinely Disjoint Subspaces. CoRR (2020)
Georg Maringer, Nikita Polyanskii, Ilya Vorobyev, Lorenz Welter
Feedback Insertion-Deletion Codes. CoRR (2020)
Lukas Holzbaur, Rina Polyanskaya, Nikita Polyanskii, Ilya Vorobyev, Eitan Yaakobi
On Lifted Multiplicity Codes. ITW (2020)
Ilya Vorobyev
Optimal Multistage Group Testing Algorithm for 3 Defectives. CoRR (2020)
Lukas Holzbaur, Rina Polyanskaya, Nikita Polyanskii, Ilya Vorobyev, Eitan Yaakobi
Lifted Multiplicity Codes. CoRR (2020)
Ilya Vorobyev
Optimal Multistage Group Testing Algorithm for 3 Defectives. ISIT (2020)
Vasiliy Usatyuk, Ilya Vorobyev
Construction of High Performance Block and Convolutional Multi-Edge Type QC-LDPC codes. TSP (2019)
Nikita Polyanskii, Ilya Vorobyev
Constructions of Batch Codes via Finite Geometry. CoRR (2019)
Arkadii G. D'yachkov, Nikita Polyanskii, Vladislav Yu. Shchukin, Ilya Vorobyev
Hypothesis Test for Bounds on the Size of Random Defective Set. IEEE Trans. Signal Process. 67 (22) (2019)
Nikita Polyanskii, Ilya Vorobyev
Trivariate Lifted Codes with Disjoint Repair Groups. REDUNDANCY (2019)
Ilya Vorobyev
A New Algorithm for Two-Stage Group Testing. CoRR (2019)
Nikita Polyanskii, Ilya Vorobyev
Constructions of Batch Codes via Finite Geometry. ISIT (2019)
Ilya Vorobyev
A New Algorithm for Two-Stage Group Testing. ISIT (2019)
Arkadii G. D'yachkov, Nikita Polyanskii, Vladislav Yu. Shchukin, Ilya Vorobyev
Separable Codes for the Symmetric Multiple-Access Channel. IEEE Trans. Inf. Theory 65 (6) (2019)
Elena Egorova, Ilya Vorobyev
New lower bound on the rate of traceability set systems. REDUNDANCY (2019)
Zilin Jiang, Nikita Polyanskii, Ilya Vorobyev
On Capacities of the Two-User Union Channel With Complete Feedback. IEEE Trans. Inf. Theory 65 (5) (2019)
Ilya Vorobyev, Nikita Polyanskii, German Svistunov, Sergey Egorov, Vasiliy Usatyuk
Generalization of Floor Lifting for QC-LDPC Codes: Theoretical Properties and Applications. EWDTS (2018)
Zilin Jiang, Nikita Polyanskii, Ilya Vorobyev
On capacities of the two-user union channel with complete feedback. CoRR (2018)
Vasiliy Usatyuk, Ilya Vorobyev
Simulated Annealing Method for Construction of High-Girth QC-LDPC Codes. TSP (2018)
Arkadii G. D'yachkov, Nikita Polyanskii, Vladislav Yu. Shchukin, Ilya Vorobyev
Separable Codes for the Symmetric Multiple-Access Channel. ISIT (2018)
Nikita Polyanskii, Vasiliy Usatyuk, Ilya Vorobyev
Floor Scale Modulo Lifting for QC-LDPC codes. CoRR (2017)
Arkadii G. D'yachkov, Nikita Polyanskii, Vladislav Yu. Shchukin, Ilya Vorobyev
Bounds for Signature Codes. CoRR (2017)
Arkadii G. D'yachkov, Ilya Vorobyev, Nikita Polyanskii, Vladislav Yu. Shchukin
Hypothesis test for upper bound on the size of random defective set. ISIT (2017)
Arkadii G. D'yachkov, Ilya Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin
Cover-free codes and separating system codes. Des. Codes Cryptogr. 82 (1-2) (2017)
Arkadii G. D'yachkov, Ilya Vorobyev, Nikita Polyanskii, Vladislav Yu. Shchukin
Almost cover-free codes and designs. Des. Codes Cryptogr. 82 (1-2) (2017)
Arkadii G. D'yachkov, Ilya Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin
Symmetric disjunctive list-decoding codes. Des. Codes Cryptogr. 82 (1-2) (2017)
Arkadii G. D'yachkov, Nikita Polyanskii, Vladislav Yu. Shchukin, Ilya Vorobyev
Bounds on the rate of disjunctive codes (in Russian). CoRR (2016)
Arkadii G. D'yachkov, Ilya Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin
Almost Disjunctive List-Decoding Codes. CoRR (2014)
Arkadii G. D'yachkov, Ilya Vorobyev, Nikita Polyanskii, Vladislav Yu. Shchukin
Symmetric Disjunctive List-Decoding Codes. CoRR (2014)
Arkadii G. D'yachkov, Ilya Vorobyev, Nikita Polyanskii, Vladislav Yu. Shchukin
Almost Cover-Free Codes. CoRR (2014)
Arkadii G. D'yachkov, Ilya Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin
Bounds on the rate of superimposed codes. ISIT (2014)