Follow
Nikita Polyanskii
Nikita Polyanskii
Other namesNikita Polianskii, Nikita Polyansky
IOTA Foundation
Verified email at iota.org - Homepage
Title
Cited by
Cited by
Year
On the metric dimension of Cartesian powers of a graph
Z Jiang, N Polyanskii
Journal of Combinatorial Theory, Series A 165, 1-14, 2019
452019
Bounds on the rate of disjunctive codes
AG D’yachkov, IV Vorob’ev, NA Polyansky, VY Shchukin
Problems of Information Transmission 50 (1), 27-56, 2014
402014
Tangle 2.0 leaderless nakamoto consensus on the heaviest dag
S Müller, A Penzkofer, N Polyanskii, J Theis, W Sanders, H Moog
IEEE Access 10, 105807-105842, 2022
312022
Optimal codes correcting a burst of deletions of variable length
A Lenz, N Polyanskii
2020 IEEE International Symposium on Information Theory (ISIT), 757-762, 2020
242020
Systematic single-deletion multiple-substitution correcting codes
W Song, N Polyanskii, K Cai, X He
IEEE Transactions on Information Theory, 2022
19*2022
Almost disjunctive list-decoding codes
AG D’yachkov, IV Vorob’ev, NA Polyansky, VY Shchukin
Problems of Information Transmission 51, 110-131, 2015
192015
Separable codes for the symmetric multiple-access channel
A D’yachkov, N Polyanskii, V Shchukin, I Vorobyev
IEEE Transactions on Information Theory 65 (6), 3738-3750, 2019
182019
Bounds on the rate of superimposed codes
AG D'yachkov, IV Vorobyev, NA Polyanskii, VY Shchukin
2014 IEEE International Symposium on Information Theory, 2341-2345, 2014
172014
Weight Distributions for Successive Cancellation Decoding of Polar Codes
R Polyanskaya, M Davletshin, N Polyanskii
IEEE Transactions on Communications, 1-9, 2020
162020
On multiple-deletion multiple-substitution correcting codes
W Song, N Polyanskii, K Cai, X He
2021 IEEE international symposium on information theory (ISIT), 2655-2660, 2021
142021
Erratum to:“Bounds on the rate of disjunctive codes”
AG D’yachkov, IV Vorob’ev, NA Polyansky, VY Shchukin
Problems of Information Transmission 52, 200-200, 2016
132016
Cover-free codes and separating system codes
AG D’yachkov, IV Vorobyev, NA Polyanskii, VY Shchukin
Designs, Codes and Cryptography 82, 197-209, 2017
102017
Codes for the Z-channel
N Polyanskii, Y Zhang
IEEE Transactions on Information Theory, 2023
92023
Optimal Codes Correcting Localized Deletions
R Bitar, SK Hanna, N Polyanskii, I Vorobyev
2021 IEEE International Symposium on Information Theory (ISIT), 1991-1996, 2021
92021
Lifted reed-solomon codes with application to batch codes
L Holzbaur, R Polyanskaya, N Polyanskii, I Vorobyev
2020 IEEE International Symposium on Information Theory (ISIT), 634-639, 2020
92020
Constructions of batch codes via finite geometry
N Polyanskii, I Vorobyev
2019 IEEE International Symposium on Information Theory (ISIT), 360-364, 2019
92019
Trivariate lifted codes with disjoint repair groups
N Polyanskii, I Vorobyev
2019 XVI International Symposium" Problems of Redundancy in Information and …, 2019
82019
On a Hypergraph Approach to Multistage Group Testing Problems
A D'yachkov, I Vorobyev, N Polyanskii, V Shchukin
2016 IEEE International Symposium on Information Theory (ISIT), 1183-1187, 2016
82016
On multistage learning a hidden hypergraph
A. D'yachkov, I. Vorobyev, N. Polyanskii, V. Shchukin
2016 IEEE International Symposium on Information Theory (ISIT), 1178-1182, 2016
8*2016
On Codes for the Noisy Substring Channel
Y Yehezkeally, N Polyanskii
IEEE International Symposium on Information Theory, 1700-1705, 2021
72021
The system can't perform the operation now. Try again later.
Articles 1–20