|
|
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
|
|
2013 |
3. |
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 |
1
|
4. |
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 |
5. |
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 |
18
|
|
2004 |
6. |
È. M. Gabidulin, N. I. Pilipchuk, “Symmetric Rank Codes”, Probl. Peredachi Inf., 40:2 (2004), 3–18 ; Problems Inform. Transmission, 40:2 (2004), 103–117 |
10
|
|
1979 |
7. |
N. I. Pilipchuk, “Synchronization Errors in an Adaptive Quantizer”, Probl. Peredachi Inf., 15:3 (1979), 83–92 ; Problems Inform. Transmission, 15:3 (1979), 223–230 |
|
1977 |
8. |
V. S. Molodtsov, N. I. Pilipchuk, V. P. Yakovlev, “Calculation of Statistical Characteristics of an Adaptive Quantizer”, Probl. Peredachi Inf., 13:2 (1977), 62–71 ; Problems Inform. Transmission, 13:2 (1977), 126–132 |
|
1976 |
9. |
V. S. Molodtsov, N. I. Pilipchuk, V. P. Yakovlev, “Statistical Description of an Adaptive Quantizer”, Probl. Peredachi Inf., 12:3 (1976), 20–27 ; Problems Inform. Transmission, 12:3 (1976), 177–183 |
|
Organisations |
|
|
|
|