Bounds on the rate of superimposed codes. - Arkadii G. D'yachkov; Ilya Vorobyev; N. A. Polyanskii; Vladislav Yu. Shchukin (ISIT, 2014)

Almost Disjunctive List-Decoding Codes. - Arkadii G. D'yachkov; Ilya Vorobyev; N. A. Polyanskii; Vladislav Yu. Shchukin (CoRR, 2014)

Almost Cover-Free Codes. - Arkadii G. D'yachkov; Ilya Vorobyev; Nikita Polyanskii; Vladislav Yu. Shchukin (CoRR, 2014)

Bounds on the rate of disjunctive codes. - Arkadii G. D'yachkov; Ilya V. Vorobyev; N. A. Polyansky; Vladislav Yu. Shchukin (Probl. Inf. Transm., 2014)

Almost disjunctive list-decoding codes. - Arkadii G. D'yachkov; Ilya V. Vorobyev; N. A. Polyansky; Vladislav Yu. Shchukin (Probl. Inf. Transm., 2015)

On multistage learning a hidden hypergraph. - Arkadii G. D'yachkov; Ilya V. Vorobyev; N. A. Polyanskii; Vladislav Yu. Shchukin (ISIT, 2016)

On a hypergraph approach to multistage group testing problems. - Arkady G. D'yachkov; Ilya V. Vorobyev; N. A. Polyanskii; Vladislav Yu. Shchukin (ISIT, 2016)

Bounds on the rate of disjunctive codes (in Russian). - Arkadii G. D'yachkov; Nikita Polyanskii; Vladislav Yu. Shchukin; Ilya Vorobyev (CoRR, 2016)

Threshold Disjunctive Codes. - Arkady G. D'yachkov; Ilya V. Vorobyev; N. A. Polyanskii; Vladislav Yu. Shchukin (CoRR, 2016)

A simple construction of cover-free (s, ℓ)-code with certain constant weight. - Arkadii G. D'yachkov; Ilya V. Vorobyev; N. A. Polyanskii; Vladislav Yu. Shchukin (CoRR, 2016)

Threshold Decoding for Disjunctive Group Testing. - Arkadii G. D'yachkov; Ilya V. Vorobyev; N. A. Polyanskii; Vladislav Yu. Shchukin (CoRR, 2016)

Adaptive Learning a Hidden Hypergraph. - Arkadii G. D'yachkov; Ilya V. Vorobyev; N. A. Polyanskii; Vladislav Yu. Shchukin (CoRR, 2016)

Erratum to: "Bounds on the rate of disjunctive codes". - Arkadii G. D'yachkov; Ilya V. Vorobyev; N. A. Polyansky; Vladislav Yu. Shchukin (Probl. Inf. Transm., 2016)

Hypothesis test for upper bound on the size of random defective set. - Arkadii G. D'yachkov; Ilya Vorobyev; Nikita Polyanskii; Vladislav Yu. Shchukin (ISIT, 2017)

Bounds for Signature Codes. - Arkadii G. D'yachkov; Nikita Polyanskii; Vladislav Yu. Shchukin; Ilya Vorobyev (CoRR, 2017)

Floor Scale Modulo Lifting for QC-LDPC codes. - Nikita Polyanskii; Vasiliy Usatyuk; Ilya Vorobyev (CoRR, 2017)

Cover-free codes and separating system codes. - Arkadii G. D'yachkov; Ilya Vorobyev; N. A. Polyanskii; Vladislav Yu. Shchukin (Des. Codes Cryptogr., 2017)

Symmetric disjunctive list-decoding codes. - Arkadii G. D'yachkov; Ilya Vorobyev; N. A. Polyanskii; Vladislav Yu. Shchukin (Des. Codes Cryptogr., 2017)

Almost cover-free codes and designs. - Arkadii G. D'yachkov; Ilya Vorobyev; Nikita Polyanskii; Vladislav Yu. Shchukin (Des. Codes Cryptogr., 2017)

Bounds on the rate of separating codes. - Ilya V. Vorobyev (Probl. Inf. Transm., 2017)

Generalization of Floor Lifting for QC-LDPC Codes: Theoretical Properties and Applications. - Ilya Vorobyev; Nikita Polyanskii; German Svistunov; Sergey Egorov; Vasiliy Usatyuk (EWDTS, 2018)

Simulated Annealing Method for Construction of High-Girth QC-LDPC Codes. - Vasiliy Usatyuk; Ilya Vorobyev (TSP, 2018)

Constructions of Batch Codes via Finite Geometry. - Nikita Polyanskii; Ilya Vorobyev (ISIT, 2019)

A New Algorithm for Two-Stage Group Testing. - Ilya Vorobyev (ISIT, 2019)

New lower bound on the rate of traceability set systems. - Elena Egorova; Ilya Vorobyev (REDUNDANCY, 2019)

Trivariate Lifted Codes with Disjoint Repair Groups. - Nikita Polyanskii; Ilya Vorobyev (REDUNDANCY, 2019)

Construction of High Performance Block and Convolutional Multi-Edge Type QC-LDPC codes. - Vasiliy Usatyuk; Ilya Vorobyev (TSP, 2019)

Separable Codes for the Symmetric Multiple-Access Channel. - Arkadii G. D'yachkov; Nikita Polyanskii; Vladislav Yu. Shchukin; Ilya Vorobyev (IEEE Trans. Inf. Theory, 2019)

On Capacities of the Two-User Union Channel With Complete Feedback. - Zilin Jiang; Nikita Polyanskii; Ilya Vorobyev (IEEE Trans. Inf. Theory, 2019)

Hypothesis Test for Bounds on the Size of Random Defective Set. - Arkadii G. D'yachkov; Nikita Polyanskii; Vladislav Yu. Shchukin; Ilya Vorobyev (IEEE Trans. Signal Process., 2019)

Lifted Reed-Solomon Codes with Application to Batch Codes. - Lukas Holzbaur; Rina Polyanskaya; Nikita Polyanskii; Ilya Vorobyev (ISIT, 2020)

Duplication with transposition distance to the root for q-ary strings. - Nikita Polyanskii; Ilya Vorobyev (ISIT, 2020)

Optimal Multistage Group Testing Algorithm for 3 Defectives. - Ilya Vorobyev (ISIT, 2020)

On Lifted Multiplicity Codes. - Lukas Holzbaur; Rina Polyanskaya; Nikita Polyanskii; Ilya Vorobyev; Eitan Yaakobi (ITW, 2020)

Binary Batch Codes With Improved Redundancy. - Rina Polyanskaya; Nikita Polyanskii; Ilya Vorobyev (IEEE Trans. Inf. Theory, 2020)

Optimal Codes Correcting Localized Deletions. - Rawad Bitar; Serge Kas Hanna; Nikita Polyanskii; Ilya Vorobyev (ISIT, 2021)

Fast Decoding of Union-Free Codes. - Ilya Vorobyev (REDUNDANCY, 2021)

Almost affinely disjoint subspaces. - Hedongliang Liu; Nikita Polianskii; Ilya Vorobyev; Antonia Wachter-Zeh (Finite Fields Their Appl., 2021)

Feedback Insertion-Deletion Codes. - Georg Maringer; N. A. Polyanskii; Ilya V. Vorobyev; Lorenz Welter (Probl. Inf. Transm., 2021)

Lifted Reed-Solomon Codes and Lifted Multiplicity Codes. - Lukas Holzbaur; Rina Polyanskaya; Nikita Polyanskii; Ilya Vorobyev; Eitan Yaakobi (IEEE Trans. Inf. Theory, 2021)

Non-adaptive and two-stage coding over the Z-channel. - Alexey V. Lebedev; Ilya Vorobyev; Vladimir S. Lebedev; Christian Deppe (CoRR, 2022)

Note on generalized group testing. - Ilya Vorobyev (CoRR, 2022)

Correcting a Single Error in Feedback Channels. - Ilya V. Vorobyev; Christian Deppe; Alexey V. Lebedev; Vladimir S. Lebedev (Probl. Inf. Transm., 2022)

Codes Correcting a Single Long Duplication Error. - Daniil Goshkoder; Nikita Polyanskii; Ilya Vorobyev (ISIT, 2023)

Correcting One Error in Non-Binary Channels with Feedback. - Ilya Vorobyev; Vladimir S. Lebedev; Alexey V. Lebedev (ISIT, 2023)

Correcting one error in channels with feedback. - Ilya Vorobyev; Alexey S. Lebedev; Vladimir S. Lebedev; Christian Deppe (CoRR, 2023)

Wiener index and graphs, almost half of whose vertices satisfy Šoltés property. - Margarita Akhmejanova; Konstantin Olmezov; Aleksei Volostnov; Ilya Vorobyev; Konstantin V. Vorob'ev; Yury Yarovikov (Discret. Appl. Math., 2023)

Complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise with optimal rate. - Ilya Vorobyev (Des. Codes Cryptogr., 2023)

Covering Codes for the Fixed Length Levenshtein Metric. - Ilya V. Vorobyev (Probl. Inf. Transm., 2023)

Deterministic Identification: From Theoretical Analysis to Practical Identification Codes. - Ilya Vorobyev; Christian Deppe; Luis Torres-Figueroa; Holger Boche (ISIT, 2024)

Efficient Combinatorial Group Testing: Bridging the Gap between Union-Free and Disjunctive Codes. - Daniil Goshkoder; Nikita Polyanskii; Ilya Vorobyev (CoRR, 2024)

Deterministic Identification Codes for Fading Channels. - Ilya Vorobyev; Christian Deppe; Holger Boche (CoRR, 2024)

Codes Correcting Long Duplication Errors. - Daniil Goshkoder; Nikita Polyanskii; Ilya Vorobyev (IEEE Trans. Mol. Biol. Multi Scale Commun., 2024)

Correcting a Single Error in an Asymmetric Feedback Channel. - Ilya V. Vorobyev; Alexey V. Lebedev; Vladimir S. Lebedev (Probl. Inf. Transm., 2024)

Secure Codes With List Decoding. - Yujie Gu; Ilya Vorobyev; Ying Miao 001 (IEEE Trans. Inf. Theory, 2024)

Starfish: A high throughput BFT protocol on uncertified DAG with linear amortized communication complexity. - Nikita Polyanskii; Sebastian Mueller; Ilya Vorobyev (IACR Cryptol. ePrint Arch., 2025)