Publications in Math-Net.Ru
-
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
-
Interrelation of Characteristics of Blocked Random
Multiple Access Stack Algorithms
Probl. Peredachi Inf., 43:4 (2007), 83–92
-
Throughput Analysis for a Noise-Resistant Multiple Access Algorithm
Probl. Peredachi Inf., 22:2 (1986), 104–109
-
On Decoding Complexity for Linear Codes
Probl. Peredachi Inf., 19:1 (1983), 3–8
-
Performance Evaluation of the Collision Resolution for a Random-Access Noisy Channel
Probl. Peredachi Inf., 18:2 (1982), 101–105
© , 2024