|
|
|
Publications in Math-Net.Ru |
Citations |
|
2022 |
| 1. |
V. V. Zyablov, F. I. Ivanov, E. A. Krouk, V. R. Sidorenko, “On new problems in asymmetric cryptography based on error-resistant coding”, Probl. Peredachi Inf., 58:2 (2022), 92–111  |
1
|
|
2012 |
| 2. |
J. Weber, V. R. Sidorenko, C. Senger, K. Abdel-Ghaffar, “Asymptotic single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff”, Probl. Peredachi Inf., 48:4 (2012), 30–40 ; Problems Inform. Transmission, 48:12 (2012), 324–333  |
1
|
|
2011 |
| 3. |
V. R. Sidorenko, G. Schmidt, “A linear algebraic approach to multisequence shift-register synthesis”, Probl. Peredachi Inf., 47:2 (2011), 72–89  ; Problems Inform. Transmission, 47:2 (2011), 149–165  |
10
|
| 4. |
A. Wachter, V. R. Sidorenko, M. Bossert, V. V. Zyablov, “On (partial) unit memory codes based on Gabidulin codes”, Probl. Peredachi Inf., 47:2 (2011), 38–51 ; Problems Inform. Transmission, 47:2 (2011), 117–129 |
21
|
|
2010 |
| 5. |
C. Senger, V. R. Sidorenko, M. Bossert, V. V. Zyablov, “Multitrial decoding of concatenated codes using fixed thresholds”, Probl. Peredachi Inf., 46:2 (2010), 30–46 ; Problems Inform. Transmission, 46:2 (2010), 127–141 |
6
|
|
2006 |
| 6. |
C. Medina, V. R. Sidorenko, V. V. Zyablov, “Error Exponents for Product Convolutional
Codes”, Probl. Peredachi Inf., 42:3 (2006), 3–20 ; Problems Inform. Transmission, 42:3 (2006), 167–182 |
5
|
|
2002 |
| 7. |
H. Grießer, V. R. Sidorenko, “A Posteriory Probability Decoding of Nonsystematically Encoded Block Codes”, Probl. Peredachi Inf., 38:3 (2002), 20–33  ; Problems Inform. Transmission, 38:3 (2002), 182–193 |
23
|
|
1997 |
| 8. |
M. Bossert, M. Breitbach, V. V. Zyablov, V. R. Sidorenko, “Codes Correcting a Set of Clusters of Errors or Erasures”, Probl. Peredachi Inf., 33:4 (1997), 15–25 ; Problems Inform. Transmission, 33:4 (1997), 297–306 |
2
|
| 9. |
V. R. Sidorenko, “The Euler Characteristic of the Minimal Code Trellis is Maximum”, Probl. Peredachi Inf., 33:1 (1997), 87–93 ; Problems Inform. Transmission, 33:1 (1997), 72–77 |
12
|
|
1993 |
| 10. |
V. V. Zyablov, V. G. Potapov, V. R. Sidorenko, “Maximum-Likelihood List Decoding Using Trellises”, Probl. Peredachi Inf., 29:4 (1993), 3–10 ; Problems Inform. Transmission, 29:4 (1993), 299–305 |
| 11. |
V. V. Zyablov, V. R. Sidorenko, “Bounds on Complexity of Trellis Decoding of Linear Block Codes”, Probl. Peredachi Inf., 29:3 (1993), 3–9 ; Problems Inform. Transmission, 29:3 (1993), 203–208 |
4
|
|
1992 |
| 12. |
V. V. Zyablov, V. R. Sidorenko, “Soft-Decision Maximum-Likelihood Decoding of Partial-Unit-Memory Codes”, Probl. Peredachi Inf., 28:1 (1992), 22–27 ; Problems Inform. Transmission, 28:1 (1992), 18–22 |
|
1976 |
| 13. |
È. M. Gabidulin, V. R. Sidorenko, “On One General Bound for Code Volume”, Probl. Peredachi Inf., 12:4 (1976), 31–35 ; Problems Inform. Transmission, 12:4 (1976), 266–269 |
| 14. |
V. R. Sidorenko, “Class of Correcting Codes for Errors With a Lattice Configuration”, Probl. Peredachi Inf., 12:3 (1976), 3–12 ; Problems Inform. Transmission, 12:3 (1976), 165–171 |
|
1975 |
| 15. |
V. R. Sidorenko, “An Upper Bound on the Volume of $q$-ary Codes”, Probl. Peredachi Inf., 11:3 (1975), 14–20 ; Problems Inform. Transmission, 11:3 (1975), 190–194 |
|
| Presentations in Math-Net.Ru |
|
|
| Organisations |
|
| |
|
|
Contact us: