|
|
|
Publications in Math-Net.Ru |
Citations |
|
2016 |
| 1. |
E. A. Bakin, G. S. Evseev, “Remark on “On the capacity of a multiple-access vector adder channel” by A. A. Frolov and V. V. Zyablov”, Probl. Peredachi Inf., 52:1 (2016), 3–7    ; Problems Inform. Transmission, 52:1 (2016), 1–5   |
3
|
|
2007 |
| 2. |
G. S. Evseev, A. M. Tyurlikov, “Interrelation of Characteristics of Blocked Random
Multiple Access Stack Algorithms”, Probl. Peredachi Inf., 43:4 (2007), 83–92  ; Problems Inform. Transmission, 43:4 (2007), 344–352 |
6
|
|
1986 |
| 3. |
G. S. Evseev, A. M. Tyurlikov, “Throughput Analysis for a Noise-Resistant Multiple Access Algorithm”, Probl. Peredachi Inf., 22:2 (1986), 104–109 |
1
|
|
1983 |
| 4. |
G. S. Evseev, “On Decoding Complexity for Linear Codes”, Probl. Peredachi Inf., 19:1 (1983), 3–8 ; Problems Inform. Transmission, 19:1 (1983), 1–6 |
1
|
|
1982 |
| 5. |
G. S. Evseev, N. G. Ermolaev, “Performance Evaluation of the Collision Resolution for a Random-Access Noisy Channel”, Probl. Peredachi Inf., 18:2 (1982), 101–105 |
1
|
|
| Organisations |
|
| |
|
|
Contact us: