default search action
Ilya Vorobyev
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j21]Ilya V. Vorobyev, Alexey V. Lebedev, Vladimir S. Lebedev:
Correcting a Single Error in an Asymmetric Feedback Channel. Probl. Inf. Transm. 60(1): 21-27 (2024) - [j20]Yujie Gu
, Ilya Vorobyev
Secure Codes With List Decoding. IEEE Trans. Inf. Theory 70(4): 2430-2442 (2024) - [j19]Daniil Goshkoder
Codes Correcting Long Duplication Errors. IEEE Trans. Mol. Biol. Multi Scale Commun. 10(2): 272-288 (2024) - [c26]Ilya Vorobyev, Christian Deppe, Luis Torres-Figueroa, Holger Boche:
Deterministic Identification: From Theoretical Analysis to Practical Identification Codes. ISIT 2024: 303-308 - [i35]Daniil Goshkoder, Nikita Polyanskii, Ilya Vorobyev:
Efficient Combinatorial Group Testing: Bridging the Gap between Union-Free and Disjunctive Codes. CoRR abs/2401.16540 (2024) - [i34]Ilya Vorobyev, Christian Deppe, Holger Boche:
Deterministic Identification Codes for Fading Channels. CoRR abs/2404.02723 (2024) - 2023
- [j18]Margarita Akhmejanova, Konstantin Olmezov, Aleksei Volostnov, Ilya Vorobyev, Konstantin V. Vorob'ev, Yury Yarovikov:
Wiener index and graphs, almost half of whose vertices satisfy Šoltés property. Discret. Appl. Math. 325: 37-42 (2023) - [j17]Ilya Vorobyev
Complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise with optimal rate. Des. Codes Cryptogr. 91(4): 1183-1191 (2023) - [j16]Ilya V. Vorobyev:
Covering Codes for the Fixed Length Levenshtein Metric. Probl. Inf. Transm. 59(2): 86-98 (2023) - [c25]Ilya Vorobyev, Vladimir S. Lebedev, Alexey V. Lebedev:
Correcting One Error in Non-Binary Channels with Feedback. ISIT 2023: 1266-1270 - [c24]Daniil Goshkoder, Nikita Polyanskii, Ilya Vorobyev:
Codes Correcting a Single Long Duplication Error. ISIT 2023: 2708-2713 - [i33]Ilya Vorobyev, Alexey S. Lebedev, Vladimir S. Lebedev, Christian Deppe:
Correcting one error in channels with feedback. CoRR abs/2301.01848 (2023) - [i32]Yujie Gu, Ilya Vorobyev, Ying Miao:
Secure Codes with List Decoding. CoRR abs/2302.02414 (2023) - [i31]Daniil Goshkoder, Nikita Polyanskii, Ilya Vorobyev:
Codes Correcting a Single Long Duplication Error. CoRR abs/2304.12399 (2023) - [i30]Ilya Vorobyev, Vladimir S. Lebedev, Alexey V. Lebedev:
Correcting One Error in Non-Binary Channels with Feedback. CoRR abs/2305.06691 (2023) - 2022
- [j15]Ilya V. Vorobyev, Christian Deppe, Alexey V. Lebedev, Vladimir S. Lebedev:
Correcting a Single Error in Feedback Channels. Probl. Inf. Transm. 58(4): 329-340 (2022) - [c23]Yujie Gu, Ilya Vorobyev, Ying Miao:
Secure codes with list decoding. ISIT 2022: 2350-2355 - [i29]Alexey V. Lebedev, Ilya Vorobyev, Vladimir S. Lebedev, Christian Deppe:
Non-adaptive and two-stage coding over the Z-channel. CoRR abs/2202.00136 (2022) - [i28]Ilya Vorobyev:
Note on generalized group testing. CoRR abs/2211.04264 (2022) - 2021
- [j14]Hedongliang Liu
Almost affinely disjoint subspaces. Finite Fields Their Appl. 75: 101879 (2021) - [j13]Georg Maringer, N. A. Polyanskii, Ilya V. Vorobyev, Lorenz Welter:
Feedback Insertion-Deletion Codes. Probl. Inf. Transm. 57(3): 212-240 (2021) - [j12]Lukas Holzbaur
Lifted Reed-Solomon Codes and Lifted Multiplicity Codes. IEEE Trans. Inf. Theory 67(12): 8051-8069 (2021) - [c22]Rawad Bitar, Serge Kas Hanna, Nikita Polyanskii, Ilya Vorobyev:
Optimal Codes Correcting Localized Deletions. ISIT 2021: 1991-1996 - [c21]Ilya Vorobyev:
Fast Decoding of Union-Free Codes. REDUNDANCY 2021: 106-109 - [i27]Rawad Bitar, Serge Kas Hanna, Nikita Polyanskii, Ilya Vorobyev:
Optimal Codes Correcting Localized Deletions. CoRR abs/2105.02298 (2021) - [i26]Ilya Vorobyev:
Complete Traceability Multimedia Fingerprinting Codes Resistant to Averaging Attack and Adversarial Noise with Optimal Rate. CoRR abs/2108.09015 (2021) - [i25]Ilya Vorobyev:
Fast Decoding of Union-free Codes. CoRR abs/2108.13359 (2021) - [i24]Lukas Holzbaur, Rina Polyanskaya, Nikita Polyanskii, Ilya Vorobyev, Eitan Yaakobi:
Lifted Reed-Solomon Codes and Lifted Multiplicity Codes. CoRR abs/2110.02008 (2021) - 2020
- [j11]Rina Polyanskaya, Nikita Polyanskii
Binary Batch Codes With Improved Redundancy. IEEE Trans. Inf. Theory 66(12): 7360-7370 (2020) - [c20]Ilya Vorobyev:
Optimal Multistage Group Testing Algorithm for 3 Defectives. ISIT 2020: 90-95 - [c19]Lukas Holzbaur, Rina Polyanskaya, Nikita Polyanskii, Ilya Vorobyev:
Lifted Reed-Solomon Codes with Application to Batch Codes. ISIT 2020: 634-639 - [c18]Nikita Polyanskii, Ilya Vorobyev:
Duplication with transposition distance to the root for q-ary strings. ISIT 2020: 2903-2908 - [c17]Lukas Holzbaur, Rina Polyanskaya, Nikita Polyanskii, Ilya Vorobyev, Eitan Yaakobi:
On Lifted Multiplicity Codes. ITW 2020: 1-5 - [c16]Georg Maringer, Nikita Polyanskii, Ilya Vorobyev, Lorenz Welter:
Feedback Insertion-Deletion Codes. ITW 2020: 1-5 - [i23]Nikita Polyanskii, Ilya Vorobyev:
Duplication with transposition distance to the root for $q$-ary strings. CoRR abs/2001.06242 (2020) - [i22]Ilya Vorobyev:
Optimal Multistage Group Testing Algorithm for 3 Defectives. CoRR abs/2001.08005 (2020) - [i21]Lukas Holzbaur, Rina Polyanskaya, Nikita Polyanskii, Ilya Vorobyev:
Lifted Reed-Solomon Codes with Application to Batch Codes. CoRR abs/2001.11981 (2020) - [i20]Hedongliang Liu, Nikita Polyanskii, Ilya Vorobyev, Antonia Wachter-Zeh:
Almost Affinely Disjoint Subspaces. CoRR abs/2007.01792 (2020) - [i19]Lukas Holzbaur, Rina Polyanskaya, Nikita Polyanskii, Ilya Vorobyev, Eitan Yaakobi:
Lifted Multiplicity Codes. CoRR abs/2008.04717 (2020) - [i18]Georg Maringer, Nikita Polyanskii, Ilya Vorobyev, Lorenz Welter:
Feedback Insertion-Deletion Codes. CoRR abs/2010.15928 (2020)
2010 – 2019
- 2019
- [j10]Zilin Jiang
On Capacities of the Two-User Union Channel With Complete Feedback. IEEE Trans. Inf. Theory 65(5): 2774-2781 (2019) - [j9]Arkadii G. D'yachkov, Nikita Polyanskii
Separable Codes for the Symmetric Multiple-Access Channel. IEEE Trans. Inf. Theory 65(6): 3738-3750 (2019) - [j8]Arkadii G. D'yachkov, Nikita Polyanskii
Hypothesis Test for Bounds on the Size of Random Defective Set. IEEE Trans. Signal Process. 67(22): 5775-5784 (2019) - [c15]Ilya Vorobyev:
A New Algorithm for Two-Stage Group Testing. ISIT 2019: 101-105 - [c14]Nikita Polyanskii, Ilya Vorobyev:
Constructions of Batch Codes via Finite Geometry. ISIT 2019: 360-364 - [c13]Nikita Polyanskii, Ilya Vorobyev:
Trivariate Lifted Codes with Disjoint Repair Groups. REDUNDANCY 2019: 64-68 - [c12]Elena Egorova, Ilya Vorobyev:
New lower bound on the rate of traceability set systems. REDUNDANCY 2019: 93-98 - [c11]Vasiliy Usatyuk
Construction of High Performance Block and Convolutional Multi-Edge Type QC-LDPC codes. TSP 2019: 158-163 - [i17]Ilya Vorobyev:
A New Algorithm for Two-Stage Group Testing. CoRR abs/1901.06740 (2019) - [i16]Nikita Polyanskii, Ilya Vorobyev:
Constructions of Batch Codes via Finite Geometry. CoRR abs/1901.06741 (2019) - 2018
- [c10]Ilya Vorobyev, Nikita Polyanskii, German Svistunov
Generalization of Floor Lifting for QC-LDPC Codes: Theoretical Properties and Applications. EWDTS 2018: 1-6 - [c9]Arkadii G. D'yachkov, Nikita Polyanskii, Vladislav Yu. Shchukin, Ilya Vorobyev
Separable Codes for the Symmetric Multiple-Access Channel. ISIT 2018: 291-295 - [c8]Vasiliy Usatyuk
Simulated Annealing Method for Construction of High-Girth QC-LDPC Codes. TSP 2018: 1-5 - [i15]Zilin Jiang, Nikita Polyanskii, Ilya Vorobyev:
On capacities of the two-user union channel with complete feedback. CoRR abs/1804.08599 (2018) - 2017
- [j7]Arkadii G. D'yachkov, Ilya Vorobyev
Cover-free codes and separating system codes. Des. Codes Cryptogr. 82(1-2): 197-209 (2017) - [j6]Arkadii G. D'yachkov, Ilya Vorobyev
Symmetric disjunctive list-decoding codes. Des. Codes Cryptogr. 82(1-2): 211-229 (2017) - [j5]Arkadii G. D'yachkov, Ilya Vorobyev
Almost cover-free codes and designs. Des. Codes Cryptogr. 82(1-2): 231-247 (2017) - [j4]Ilya V. Vorobyev
Bounds on the rate of separating codes. Probl. Inf. Transm. 53(1): 30-41 (2017) - [c7]Arkadii G. D'yachkov, Ilya Vorobyev
Hypothesis test for upper bound on the size of random defective set. ISIT 2017: 978-982 - [i14]Arkadii G. D'yachkov, Nikita Polyanskii, Vladislav Yu. Shchukin, Ilya Vorobyev:
Bounds for Signature Codes. CoRR abs/1701.06085 (2017) - [i13]Arkadii G. D'yachkov, Ilya V. Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin:
Hypothesis Test for Upper Bound on the Size of Random Defective Set. CoRR abs/1701.06201 (2017) - [i12]Nikita Polyanskii, Vasiliy Usatyuk, Ilya Vorobyev:
Floor Scale Modulo Lifting for QC-LDPC codes. CoRR abs/1701.07521 (2017) - 2016
- [j3]Arkadii G. D'yachkov, Ilya V. Vorobyev, N. A. Polyansky, Vladislav Yu. Shchukin
Erratum to: "Bounds on the rate of disjunctive codes". Probl. Inf. Transm. 52(2): 200 (2016) - [c6]Arkadii G. D'yachkov, Ilya V. Vorobyev
On multistage learning a hidden hypergraph. ISIT 2016: 1178-1182 - [c5]Arkady G. D'yachkov, Ilya V. Vorobyev
On a hypergraph approach to multistage group testing problems. ISIT 2016: 1183-1191 - [i11]Arkady G. D'yachkov, Ilya V. Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin:
On a Hypergraph Approach to Multistage Group Testing Problems. CoRR abs/1601.06704 (2016) - [i10]Arkady G. D'yachkov, Ilya V. Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin:
On Multistage Learning a Hidden Hypergraph. CoRR abs/1601.06705 (2016) - [i9]Arkady G. D'yachkov, Ilya V. Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin:
Threshold Disjunctive Codes. CoRR abs/1601.06709 (2016) - [i8]Arkadii G. D'yachkov, Nikita Polyanskii, Vladislav Yu. Shchukin, Ilya Vorobyev:
Bounds on the rate of disjunctive codes (in Russian). CoRR abs/1605.05363 (2016) - [i7]Arkadii G. D'yachkov, Ilya V. Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin:
A simple construction of cover-free (s, ℓ)-code with certain constant weight. CoRR abs/1605.06847 (2016) - [i6]Arkadii G. D'yachkov, Ilya V. Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin:
Threshold Decoding for Disjunctive Group Testing. CoRR abs/1607.00502 (2016) - [i5]Arkadii G. D'yachkov, Ilya V. Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin:
Adaptive Learning a Hidden Hypergraph. CoRR abs/1607.00507 (2016) - [i4]Arkadii G. D'yachkov, Ilya V. Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin:
On a Hypergraph Approach to Multistage Group Testing Problems. CoRR abs/1607.00511 (2016) - 2015
- [j2]Arkadii G. D'yachkov, Ilya V. Vorobyev
Almost disjunctive list-decoding codes. Probl. Inf. Transm. 51(2): 110-131 (2015) - [c4]Arkady G. D'yachkov, Ilya V. Vorobyev
Symmetric disjunctive list-decoding codes. ISIT 2015: 2236-2240 - [c3]Arkady G. D'yachkov, Ilya V. Vorobyev
Cover-free codes and separating system codes. ISIT 2015: 2894-2898 - [c2]Arkady G. D'yachkov, Ilya V. Vorobyev
Almost cover-free codes and designs. ISIT 2015: 2899-2903 - 2014
- [j1]Arkadii G. D'yachkov, Ilya V. Vorobyev
Bounds on the rate of disjunctive codes. Probl. Inf. Transm. 50(1): 27-56 (2014) - [c1]Arkadii G. D'yachkov, Ilya Vorobyev
Bounds on the rate of superimposed codes. ISIT 2014: 2341-2345 - [i3]Arkadii G. D'yachkov, Ilya Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin:
Almost Disjunctive List-Decoding Codes. CoRR abs/1407.2482 (2014) - [i2]Arkadii G. D'yachkov, Ilya Vorobyev, Nikita Polyanskii, Vladislav Yu. Shchukin:
Symmetric Disjunctive List-Decoding Codes. CoRR abs/1410.8385 (2014) - [i1]Arkadii G. D'yachkov, Ilya Vorobyev, Nikita Polyanskii, Vladislav Yu. Shchukin:
Almost Cover-Free Codes. CoRR abs/1410.8566 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-13 17:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: