|
|
|
Publications in Math-Net.Ru |
Citations |
|
2021 |
| 1. |
E. M. Gabidulin, N. I. Pilipchuk, O. V. Trushina, “Bounds on the cardinality of subspace codes with non-maximum code distance”, Probl. Peredachi Inf., 57:3 (2021), 48–54  ; Problems Inform. Transmission, 57:3 (2021), 241–247   |
1
|
|
2016 |
| 2. |
E. M. Gabidulin, N. I. Pilipchuk, “Multicomponent codes with maximum code distance”, Probl. Peredachi Inf., 52:3 (2016), 84–91  ; Problems Inform. Transmission, 52:3 (2016), 276–283 |
4
|
|
2015 |
| 3. |
O. V. Trushina, E. M. Gabidulin, “A new method for ensuring anonymity and security in network coding”, Probl. Peredachi Inf., 51:1 (2015), 82–89 ; Problems Inform. Transmission, 51:1 (2015), 75–81 |
4
|
|
2013 |
| 4. |
E. M. Gabidulin, N. I. Pilipchuk, B. Honary, H. Rashwan, “Information security in a random network coding network”, Probl. Peredachi Inf., 49:2 (2013), 92–106 ; Problems Inform. Transmission, 49:2 (2013), 179–191 |
2
|
| 5. |
E. M. Gabidulin, N. I. Pilipchuk, “Rank subcodes in multicomponent network coding”, Probl. Peredachi Inf., 49:1 (2013), 46–60 ; Problems Inform. Transmission, 49:1 (2013), 40–53 |
13
|
|
2010 |
| 6. |
E. M. Gabidulin, N. I. Pilipchuk, M. Bossert, “Decoding of random network codes”, Probl. Peredachi Inf., 46:4 (2010), 33–55  ; Problems Inform. Transmission, 46:4 (2010), 300–320 |
19
|
|
2009 |
| 7. |
E. M. Gabidulin, M. Bossert, “Algebraic codes for network coding”, Probl. Peredachi Inf., 45:4 (2009), 54–68  ; Problems Inform. Transmission, 45:4 (2009), 343–356 |
16
|
|
2008 |
| 8. |
C. Martinez, E. Stafford, R. Beivide, È. M. Gabidulin, “Modeling Hexagonal Constellations with Eisenstein–Jacobi Graphs”, Probl. Peredachi Inf., 44:1 (2008), 3–14 ; Problems Inform. Transmission, 44:1 (2008), 1–11 |
39
|
|
2004 |
| 9. |
È. M. Gabidulin, N. I. Pilipchuk, “Symmetric Rank Codes”, Probl. Peredachi Inf., 40:2 (2004), 3–18 ; Problems Inform. Transmission, 40:2 (2004), 103–117 |
11
|
|
2003 |
| 10. |
È. M. Gabidulin, V. A. Obernikhin, “Codes in the Vandermonde $\mathcal F$-Metric and Their Applications”, Probl. Peredachi Inf., 39:2 (2003), 3–14 ; Problems Inform. Transmission, 39:2 (2003), 159–169 |
5
|
|
2002 |
| 11. |
È. M. Gabidulin, V. V. Shorin, “New Sequences with Zero Autocorrelation”, Probl. Peredachi Inf., 38:4 (2002), 10–23 ; Problems Inform. Transmission, 38:4 (2002), 255–267 |
5
|
|
1999 |
| 12. |
È. M. Gabidulin, J. Simonis, “Perfect Codes for Metrics Generated by Primitive 2-Error-Correcting Binary BCH Codes”, Probl. Peredachi Inf., 35:3 (1999), 40–47 ; Problems Inform. Transmission, 35:3 (1999), 224–230 |
1
|
|
1985 |
| 13. |
È. M. Gabidulin, “Optimum Codes Correcting Lattice Errors”, Probl. Peredachi Inf., 21:2 (1985), 103–108 |
1
|
| 14. |
È. M. Gabidulin, “Theory of Codes with Maximum Rank Distance”, Probl. Peredachi Inf., 21:1 (1985), 3–16 ; Problems Inform. Transmission, 21:1 (1985), 1–12 |
62
|
|
1976 |
| 15. |
È. 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 |
|
1969 |
| 16. |
A. L. Larin, È. M. Gabidulin, “Propagation of Errors in the Decoding of Uniform Convolutional Codes”, Probl. Peredachi Inf., 5:3 (1969), 73–77 ; Problems Inform. Transmission, 5:3 (1969), 53–57 |
| 17. |
È. M. Gabidulin, “Bounds for the Probability of Error for Certain Channels with Memory”, Probl. Peredachi Inf., 5:1 (1969), 40–46 ; Problems Inform. Transmission, 5:1 (1969), 33–38 |
|
1967 |
| 18. |
È. M. Gabidulin, “Limits for the Decoding Error Probability when Linear Codes Are Used in Memoryless Channels”, Probl. Peredachi Inf., 3:2 (1967), 55–62 ; Problems Inform. Transmission, 3:2 (1967), 43–48 |
2
|
|
|
|
1977 |
| 19. |
È. M. Gabidulin, “K. Sh. Zigangirov. Sequential Decoding Procedures (review)”, Probl. Peredachi Inf., 13:3 (1977), 109–110 ; Problems Inform. Transmission, 13:3 (1977), 243–244 |
|
| Organisations |
|
|
