Zobrazeno 1 - 3
of 3
pro vyhledávání: '"G. S. Evseev"'
Publikováno v:
Informatsionno-upravliaiushchie sistemy (Information and Control Systems). 6:107-112
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c91432340265ceeb5db23d9556fc690e
https://doi.org/10.15217/issn1684-8853.2017.6.107
https://doi.org/10.15217/issn1684-8853.2017.6.107
Autor:
G. S. Evseev, E. A. Bakin
Publikováno v:
Problems of Information Transmission. 52:1-5
For vector adder channel, we present an upper bound on the capacity, which coincides with the lower bound given in [1]. Thus, we prove optimality of the uniform probability distribution of symbols for ? ? (0, ?*] and of the twisted distribution for ?
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::764ca4689091cae8763230aa5902c05b
https://doi.org/10.1134/s0032946016010014
https://doi.org/10.1134/s0032946016010014
Autor:
G. S. Evseev, Andrey Turlikov
Publikováno v:
Problems of Information Transmission. 43:344-352
A method to analyze the duration of collision resolution for blocked RMA stack algorithms is proposed. Simple formulas are obtained that express the average length of a collision resolution interval for the modified (frugal) algorithm in a noisy and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6e39b01fb6a6777a83a8a480a109285b
https://doi.org/10.1134/s0032946007040072
https://doi.org/10.1134/s0032946007040072