Подписаться
Ilya Vorobyev
Ilya Vorobyev
Подтвержден адрес электронной почты в домене tum.de
Название
Процитировано
Процитировано
Год
Erratum to:“Bounds on the rate of disjunctive codes”
AG D’yachkov, IV Vorob’ev, NA Polyansky, VY Shchukin
Problems of Information Transmission 52 (2), 200-200, 2016
42*2016
Bounds on the Rate of Disjunctive Codes (vol 50, pg 27, 2014)
AG D'yachkov, IV Vorob'ev, NA Polyansky, VY Shchukin
PROBLEMS OF INFORMATION TRANSMISSION 52 (2), 200-200, 2016
40*2016
Bounds on the rate of disjunctive codes
AG D’yachkov, IV Vorob’ev, NA Polyansky, VY Shchukin
Problems of Information Transmission 50, 27-56, 2014
402014
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
AG Dyachkov, N Polyanskii, V Shchukin, I Vorobyev
arXiv preprint arXiv:1701.06085, 2017
182017
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
Simulated Annealing Method for Construction of High-Girth QC-LDPC Codes
V Usatyuk, I Vorobyev
2018 41st International Conference on Telecommunications and Signal …, 2018
162018
Optimal codes correcting localized deletions
R Bitar, SK Hanna, N Polyanskii, I Vorobyev
2021 IEEE International Symposium on Information Theory (ISIT), 1991-1996, 2021
102021
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
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
AG D'yachkov, IV Vorobyev, NA Polyanskii, VY Shchukin
2016 IEEE International Symposium on Information Theory (ISIT), 1183-1191, 2016
82016
On multistage learning a hidden hypergraph
AG D'yachkov, IV Vorobyev, NA Polyanskii, VY Shchukin
Information Theory (ISIT), 2016 IEEE International Symposium on, 1178-1182, 2016
82016
Complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise with optimal rate
I Vorobyev
Designs, Codes and Cryptography 91 (4), 1183-1191, 2023
72023
Wiener index and graphs, almost half of whose vertices satisfy Šoltés property
M Akhmejanova, K Olmezov, A Volostnov, I Vorobyev, K Vorob’ev, ...
Discrete Applied Mathematics 325, 37-42, 2023
62023
Almost affinely disjoint subspaces
H Liu, N Polianskii, I Vorobyev, A Wachter-Zeh
Finite Fields and Their Applications 75, 101879, 2021
62021
Devices and methods for generating a low density parity check code for a incremental redundancy HARQ communication apparatus
VS Usatyuk, NA Polianskii, IV Vorobyev
US Patent 10,944,425, 2021
62021
Binary Batch Codes With Improved Redundancy
R Polyanskaya, N Polyanskii, I Vorobyev
IEEE Transactions on Information Theory 66 (12), 7360-7370, 2020
62020
Bounds on the rate of separating codes
IV Vorob’ev
Problems of Information Transmission 53, 30-41, 2017
62017
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20