Nikita Polyanskii

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 68

Top Topics

Hypothesis Test

Affine Invariance

Top Venues

IEEE Trans. Inf. Theory

Publications

Yonatan Yehezkeally, Nikita Polyanskii
On Codes for the Noisy Substring Channel. IEEE Trans. Mol. Biol. Multi Scale Commun. 10 (2) (2024)
Daniil Goshkoder, Nikita Polyanskii, Ilya Vorobyev
Efficient Combinatorial Group Testing: Bridging the Gap between Union-Free and Disjunctive Codes. CoRR (2024)
Daniil Goshkoder, Nikita Polyanskii, Ilya Vorobyev
Codes Correcting Long Duplication Errors. IEEE Trans. Mol. Biol. Multi Scale Commun. 10 (2) (2024)
Sebastian Müller, Andreas Penzkofer, Nikita Polyanskii, Jonas Theis, William Sanders, Hans Moog
Reality-based UTXO Ledger. Distributed Ledger Technol. Res. Pract. 2 (3) (2023)
Venkata Gandikota, Nikita Polyanskii, Haodong Yang
Combinatorial Group Testing in Presence of Deletions. CoRR (2023)
Daniil Goshkoder, Nikita Polyanskii, Ilya Vorobyev
Codes Correcting a Single Long Duplication Error. CoRR (2023)
Can Umut Ileri, Nikita Polyanskii
Dynamic Availability and Definite Finality in IOTA 2.0. BlockSys (2023)
Mayank Raikwar, Nikita Polyanskii, Sebastian Müller
Fairness Notions in DAG-Based DLTs. BRAINS (2023)
Daniil Goshkoder, Nikita Polyanskii, Ilya Vorobyev
Codes Correcting a Single Long Duplication Error. ISIT (2023)
Nikita Polyanskii, Yihan Zhang
Codes for the Z-Channel. IEEE Trans. Inf. Theory 69 (10) (2023)
Mayank Raikwar, Nikita Polyanskii, Sebastian Müller
Fairness Notions in DAG-based DLTs. CoRR (2023)
Gökberk Erdogan, Georg Maringer, Nikita Polyanskii
Signature Codes for a Noisy Adder Multiple Access Channel. ITW (2022)
Nikita Polyanskii, Yihan Zhang
List-Decodable Zero-Rate Codes for the Z-Channel. ISIT (2022)
Gökberk Erdogan, Georg Maringer, Nikita Polyanskii
Signature Codes for a Noisy Adder Multiple Access Channel. CoRR (2022)
Sebastian Müller, Andreas Penzkofer, Nikita Polyanskii, Jonas Theis, William Sanders, Hans Moog
Tangle 2.0 Leaderless Nakamoto Consensus on the Heaviest DAG. IEEE Access 10 (2022)
Sebastian Müller, Andreas Penzkofer, Nikita Polyanskii, Jonas Theis, William Sanders, Hans Moog
Tangle 2.0 Leaderless Nakamoto Consensus on the Heaviest DAG. CoRR (2022)
Alexey V. Lebedev, Vladimir S. Lebedev, Nikita Polyanskii
Two-Stage Coding Over the Z-Channel. IEEE Trans. Inf. Theory 68 (4) (2022)
Wentu Song, Nikita Polyanskii, Kui Cai, Xuan He
Systematic Codes Correcting Multiple-Deletion and Multiple-Substitution Errors. IEEE Trans. Inf. Theory 68 (10) (2022)
Sebastian Müller, Andreas Penzkofer, Nikita Polyanskii, Jonas Theis, William Sanders, Hans Moog
Reality-based UTXO Ledger. CoRR (2022)
Christian Deppe, Vladimir S. Lebedev, Georg Maringer, Nikita Polyanskii
Coding With Noiseless Feedback Over the Z-Channel. IEEE Trans. Inf. Theory 68 (6) (2022)
Wentu Song, Nikita Polyanskii, Kui Cai, Xuan He
On Multiple-Deletion Multiple-Substitution Correcting Codes. ISIT (2021)
Nikita Polyanskii
On learning sparse vectors from mixture of responses. NeurIPS (2021)
Rawad Bitar, Serge Kas Hanna, Nikita Polyanskii, Ilya Vorobyev
Optimal Codes Correcting Localized Deletions. ISIT (2021)
Nikita Polyanskii
Two-Stage Coding over the Z-Channel. ISIT (2021)
Lukas Holzbaur, Rina Polyanskaya, Nikita Polyanskii, Ilya Vorobyev, Eitan Yaakobi
Lifted Reed-Solomon Codes and Lifted Multiplicity Codes. CoRR (2021)
Yonatan Yehezkeally, Nikita Polyanskii
On Codes for the Noisy Substring Channel. ISIT (2021)
Nikita Polyanskii, Yihan Zhang
Codes for the Z-channel. CoRR (2021)
Rawad Bitar, Serge Kas Hanna, Nikita Polyanskii, Ilya Vorobyev
Optimal Codes Correcting Localized Deletions. CoRR (2021)
Yonatan Yehezkeally, Nikita Polyanskii
On Codes for the Noisy Substring Channel. CoRR (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)
Hedongliang Liu, Lukas Holzbaur, Nikita Polyanskii, Sven Puchinger, Antonia Wachter-Zeh
Quadratic-Curve-Lifted Reed-Solomon Codes. CoRR (2021)
Andreas Lenz, Nikita Polyanskii
Optimal Codes Correcting a Burst of Deletions of Variable Length. CoRR (2020)
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)
Christian Deppe, Vladimir S. Lebedev, Georg Maringer, Nikita Polyanskii
Coding with Noiseless Feedback over the Z-Channel. COCOON (2020)
Nikita Polyanskii, Ilya Vorobyev
Duplication with transposition distance to the root for $q$-ary strings. CoRR (2020)
Andreas Lenz, Nikita Polyanskii
Optimal Codes Correcting a Burst of Deletions of Variable Length. ISIT (2020)
Lukas Holzbaur, Rina Polyanskaya, Nikita Polyanskii, Ilya Vorobyev
Lifted Reed-Solomon Codes with Application to Batch Codes. ISIT (2020)
Rina Polyanskaya, Mars Davletshin, Nikita Polyanskii
Weight Distributions for Successive Cancellation Decoding of Polar Codes. IEEE Trans. Commun. 68 (12) (2020)
Nikita Polyanskii, Ilya Vorobyev
Duplication with transposition distance to the root for q-ary strings. ISIT (2020)
Lukas Holzbaur, Nikita Polyanskii
Decoding of Lifted Affine-Invariant Codes. CoRR (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)
Christian Deppe, Vladimir S. Lebedev, Georg Maringer, Nikita Polyanskii
Coding with Noiseless Feedback over the Z-channel. CoRR (2020)
Lukas Holzbaur, Rina Polyanskaya, Nikita Polyanskii, Ilya Vorobyev, Eitan Yaakobi
On Lifted Multiplicity Codes. ITW (2020)
Alexey V. Lebedev, Vladimir S. Lebedev, Nikita Polyanskii
Two-stage coding over the Z-channel. CoRR (2020)
Lukas Holzbaur, Nikita Polyanskii
Decoding of Lifted Affine-Invariant Codes. ITW (2020)
Lukas Holzbaur, Rina Polyanskaya, Nikita Polyanskii, Ilya Vorobyev, Eitan Yaakobi
Lifted Multiplicity Codes. CoRR (2020)
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)
Rina Polyanskaya, Nikita Polyanskii
Batch codes based on lifted multiplicity codes. REDUNDANCY (2019)
Nikita Polyanskii, Ilya Vorobyev
Trivariate Lifted Codes with Disjoint Repair Groups. REDUNDANCY (2019)
Nikita Polyanskii, Ilya Vorobyev
Constructions of Batch Codes via Finite Geometry. ISIT (2019)
Zilin Jiang, Nikita Polyanskii
How to guess an n-digit number. SODA (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)
Zilin Jiang, Nikita Polyanskii, Ilya Vorobyev
On Capacities of the Two-User Union Channel With Complete Feedback. IEEE Trans. Inf. Theory 65 (5) (2019)
Zilin Jiang, Nikita Polyanskii
On the metric dimension of Cartesian powers of a graph. J. Comb. Theory, Ser. A 165 (2019)
Rina Polyanskaya, Mars Davletshin, Nikita Polyanskii
Weight Distributions for Successive Cancellation Decoding of Polar Codes. CoRR (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)
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)
Zilin Jiang, Nikita Polyanskii
On the metric dimension of Cartesian powers of a graph. 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, Nikita Polyanskii, Vladislav Yu. Shchukin
Almost cover-free codes and designs. 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)
Arkady G. D'yachkov, Ilya V. Vorobyev, Nikita Polyanskii, Vladislav Yu. Shchukin
Cover-free codes and separating system codes. ISIT (2015)
Arkady G. D'yachkov, Ilya V. Vorobyev, Nikita Polyanskii, Vladislav Yu. Shchukin
Almost cover-free codes and designs. ISIT (2015)
Arkady G. D'yachkov, Ilya V. Vorobyev, Nikita Polyanskii, Vladislav Yu. Shchukin
Symmetric disjunctive list-decoding codes. ISIT (2015)
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, Julia Volkova, Nikita Polyanskii
DNA codes for generalized stem similarity. ISIT (2011)