|
|
Publications in Math-Net.Ru
-
Information theoretically secure key sharing protocol executing with constant noiseless public channels
Mat. Vopr. Kriptogr., 12:3 (2021), 125–141
-
Capacity of a Communication Channel with Inner Random Coding
Probl. Peredachi Inf., 28:4 (1992), 24–34
-
Optimal Decoding of Convolutional Codes in Channels with Additive Markov Noise
Probl. Peredachi Inf., 23:4 (1987), 35–40
-
Noise-Stable Encoding of "Unique" Messages
Probl. Peredachi Inf., 22:1 (1986), 26–31
-
Performance of $q$-ary Coding in Channels with Fading When Multiple-Frequency Signals Are Used
Probl. Peredachi Inf., 19:3 (1983), 3–11
-
Nonasymptotic Estimates for Efficiency of Code Jamming in a Wire-Tap Channel
Probl. Peredachi Inf., 17:4 (1981), 11–18
-
Multistage Universal Coding in Discrete Channels with Feedback
Probl. Peredachi Inf., 14:2 (1978), 40–45
-
Error Probability in a Channel with Fading and Signallike Noise
Probl. Peredachi Inf., 13:1 (1977), 19–25
-
Universal Stochastic Coding in Decision-Feedback Systems
Probl. Peredachi Inf., 10:4 (1974), 25–29
-
Optimal Decoding in Semicontinuous Channels with a Variable Parameter
Probl. Peredachi Inf., 7:4 (1971), 22–29
-
The Extended Hilbert Transformation and Its Application in Signal Theory
Probl. Peredachi Inf., 5:4 (1969), 3–18
-
An Estimate of $d_{\min}$ for Cyclic Codes
Probl. Peredachi Inf., 2:2 (1966), 78
-
The Correlation Between the Properties of a Binary Group Code and Those of its Null Space
Probl. Peredachi Inf., 2:1 (1966), 91–95
-
A method for obtaining estimates of the expectation of some function of $n$-dimensional random vector
Teor. Veroyatnost. i Primenen., 11:3 (1966), 537–541
-
Letter to the editor
Teor. Veroyatnost. i Primenen., 13:4 (1968), 755
© , 2026