|
|
|
Publications in Math-Net.Ru |
Citations |
|
2024 |
| 1. |
I. V. Vorobyev, A. V. Lebedev, V. S. Lebedev, “Correcting a single error in an asymmetric feedback channel”, Probl. Peredachi Inf., 60:1 (2024), 26–32  ; Problems Inform. Transmission, 60:1 (2024), 21–27 |
|
2023 |
| 2. |
I. V. Vorobyev, “Covering codes for the fixed length Levenshtein metric”, Probl. Peredachi Inf., 59:2 (2023), 18–31 ; Problems Inform. Transmission, 59:2 (2023), 86–98 |
|
2022 |
| 3. |
I. V. Vorobyev, C. Deppe, A. V. Lebedev, V. S. Lebedev, “Correcting a single error in feedback channels”, Probl. Peredachi Inf., 58:4 (2022), 38–49 ; Problems Inform. Transmission, 58:4 (2022), 329–340 |
4
|
| 4. |
I. V. Vorob'ev, V. S. Lebedev, “Improved upper bounds for the rate of separating and completely separating codes”, Probl. Peredachi Inf., 58:3 (2022), 45–57 ; Problems Inform. Transmission, 58:3 (2022), 242–253 |
1
|
|
2021 |
| 5. |
G. Maringer, N. A. Polyanskii, I. V. Vorobyev, L. Welter, “Feedback insertion-deletion codes”, Probl. Peredachi Inf., 57:3 (2021), 17–47 ; Problems Inform. Transmission, 57:3 (2021), 212–240   |
2
|
|
2017 |
| 6. |
I. V. Vorob'ev, “Bounds on the rate of separating codes”, Probl. Peredachi Inf., 53:1 (2017), 34–46  ; Problems Inform. Transmission, 53:1 (2017), 30–41 |
8
|
|
2016 |
| 7. |
A. G. D'yachkov, I. V. Vorob'ev, N. A. Polyansky, V. Yu. Shchukin, “Erratum to: “Bounds on the rate of disjunctive codes” [Problems of Information Transmission 50, 27 (2014)]”, Probl. Peredachi Inf., 52:2 (2016), 111  ; Problems Inform. Transmission, 52:2 (2016), 200 |
6
|
|
2015 |
| 8. |
A. G. D'yachkov, I. V. Vorob'ev, N. A. Polyansky, V. Yu. Shchukin, “Almost disjunctive list-decoding codes”, Probl. Peredachi Inf., 51:2 (2015), 27–49 ; Problems Inform. Transmission, 51:2 (2015), 110–131 |
12
|
|
2014 |
| 9. |
A. G. D'yachkov, I. V. Vorob'ev, N. A. Polyansky, V. Yu. Shchukin, “Bounds on the rate of disjunctive codes”, Probl. Peredachi Inf., 50:1 (2014), 31–63 ; Problems Inform. Transmission, 50:1 (2014), 27–56 |
33
|
|
| Presentations in Math-Net.Ru |
| 1. |
Multistage group testing algorithms
I. V. Vorob'ev
April 13, 2020 15:10
|
| 2. |
Несколько комбинаторных задач
I. V. Vorob'ev, V. Yu. Shchukin, E. E. Egorova, A. Maevskiy
Dobrushin Mathematics Laboratory Seminar
November 21, 2017 16:00
|
| 3. |
Неадаптивное групповое тестирование с быстрым декодированием
I. V. Vorob'ev
Seminar on Coding Theory
March 21, 2017 19:00
|
| 4. |
Верхние границы скорости кодов для q-ичного гиперканала множественного доступа
I. V. Vorob'ev
Seminar on Coding Theory
February 28, 2017 19:00
|
| 5. |
Оценка количества ребер в графе с фиксированным обхватом и композиционный код
I. V. Vorob'ev
Seminar on Coding Theory
November 22, 2016 19:00
|
| 6. |
Separating codes
I. V. Vorob'ev
Principle Seminar of the Department of Probability Theory, Moscow State University
September 21, 2016 16:45
|
| 7. |
Многоступенчатые групповые проверки
I. V. Vorob'ev
Seminar on Coding Theory
February 2, 2016 19:00
|
| 8. |
Гипотеза Эрдеша о дизъюнктивных кодах
I. V. Vorob'ev
Seminar on Coding Theory
February 17, 2015 19:00
|
|
|
| Organisations |
|
|
