DNA codes for generalized stem similarity. - Arkadii G. D'yachkov; Julia Volkova; Nikita Polyanskii (ISIT, 2011)

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)

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)

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)

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

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

Batch codes based on lifted multiplicity codes. - Rina Polyanskaya; Nikita Polyanskii (REDUNDANCY, 2019)

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

How to guess an n-digit number. - Zilin Jiang; Nikita Polyanskii (SODA, 2019)

On the metric dimension of Cartesian powers of a graph. - Zilin Jiang; Nikita Polyanskii (J. Comb. Theory A, 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)

Optimal Codes Correcting a Burst of Deletions of Variable Length. - Andreas Lenz 001; Nikita Polyanskii (ISIT, 2020)

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

Decoding of Lifted Affine-Invariant Codes. - Lukas Holzbaur; Nikita Polyanskii (ITW, 2020)

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

Weight Distributions for Successive Cancellation Decoding of Polar Codes. - Rina Polyanskaya; Mars Davletshin; Nikita Polyanskii (IEEE Trans. Commun., 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)

Two-Stage Coding over the Z-Channel. - Nikita Polyanskii (ISIT, 2021)

On Multiple-Deletion Multiple-Substitution Correcting Codes. - Wentu Song; Nikita Polyanskii; Kui Cai 001; Xuan He (ISIT, 2021)

On learning sparse vectors from mixture of responses. - Nikita Polyanskii (NeurIPS, 2021)

Quadratic-Curve-Lifted Reed-Solomon Codes. - Hedongliang Liu; Lukas Holzbaur; Nikita Polyanskii; Sven Puchinger; Antonia Wachter-Zeh (CoRR, 2021)

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

Coding in a Z-Channel in Case of Many Errors. - Vladimir S. Lebedev; N. A. Polyanskii (Probl. Inf. Transm., 2021)

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

On List Decoding of Certain 픽q-Linear Codes. - N. A. Polyanskii (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)

List-Decodable Zero-Rate Codes for the Z-Channel. - Nikita Polyanskii; Yihan Zhang 001 (ISIT, 2022)

Signature Codes for a Noisy Adder Multiple Access Channel. - Gökberk Erdogan; Georg Maringer; Nikita Polyanskii (ITW, 2022)

Tangle 2.0 Leaderless Nakamoto Consensus on the Heaviest DAG. - Sebastian Müller 006; Andreas Penzkofer; Nikita Polyanskii; Jonas Theis; William Sanders; Hans Moog (IEEE Access, 2022)

Coding With Noiseless Feedback Over the Z-Channel. - Christian Deppe; Vladimir S. Lebedev; Georg Maringer; Nikita Polyanskii (IEEE Trans. Inf. Theory, 2022)

Two-Stage Coding Over the Z-Channel. - Alexey V. Lebedev; Vladimir S. Lebedev; Nikita Polyanskii (IEEE Trans. Inf. Theory, 2022)

Systematic Codes Correcting Multiple-Deletion and Multiple-Substitution Errors. - Wentu Song; Nikita Polyanskii; Kui Cai 001; Xuan He (IEEE Trans. Inf. Theory, 2022)

Dynamic Availability and Definite Finality in IOTA 2.0. - Can Umut Ileri; Nikita Polyanskii (BlockSys, 2023)

Fairness Notions in DAG-Based DLTs. - Mayank Raikwar; Nikita Polyanskii; Sebastian Müller 006 (BRAINS, 2023)

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

Combinatorial Group Testing in Presence of Deletions. - Venkata Gandikota; Nikita Polyanskii; Haodong Yang (CoRR, 2023)

Reality-based UTXO Ledger. - Sebastian Müller 006; Andreas Penzkofer; Nikita Polyanskii; Jonas Theis; William Sanders; Hans Moog (Distributed Ledger Technol. Res. Pract., 2023)

Codes for the Z-Channel. - Nikita Polyanskii; Yihan Zhang 001 (IEEE Trans. Inf. Theory, 2023)

Dynamically available consensus on a DAG with fast confirmation for UTXO transactions. - Nikita Polyanskii (ICBC, 2024)

SoK: DAG-based Consensus Protocols. - Mayank Raikwar; Nikita Polyanskii; Sebastian Müller 006 (ICBC, 2024)

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

Deterministic Bounds in Committee Selection: Enhancing Decentralization and Scalability in Distributed Ledgers. - Grigorii Melnikov; Sebastian Müller 006; Nikita Polyanskii; Yury Yanovich (CoRR, 2024)

Slipstream: Ebb-and-Flow Consensus on a DAG with Fast Confirmation for UTXO Transactions. - Nikita Polyanskii; Sebastian Müller 006; Mayank Raikwar (CoRR, 2024)

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

On Codes for the Noisy Substring Channel. - Yonatan Yehezkeally; Nikita Polyanskii (IEEE Trans. Mol. Biol. Multi Scale Commun., 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)