RUS  ENG
Full version
PEOPLE

Korzhik V I

Publications in Math-Net.Ru

  1. Information theoretically secure key sharing protocol executing with constant noiseless public channels

    Mat. Vopr. Kriptogr., 12:3 (2021),  125–141
  2. Capacity of a Communication Channel with Inner Random Coding

    Probl. Peredachi Inf., 28:4 (1992),  24–34
  3. Optimal Decoding of Convolutional Codes in Channels with Additive Markov Noise

    Probl. Peredachi Inf., 23:4 (1987),  35–40
  4. Noise-Stable Encoding of "Unique" Messages

    Probl. Peredachi Inf., 22:1 (1986),  26–31
  5. Performance of $q$-ary Coding in Channels with Fading When Multiple-Frequency Signals Are Used

    Probl. Peredachi Inf., 19:3 (1983),  3–11
  6. Nonasymptotic Estimates for Efficiency of Code Jamming in a Wire-Tap Channel

    Probl. Peredachi Inf., 17:4 (1981),  11–18
  7. Multistage Universal Coding in Discrete Channels with Feedback

    Probl. Peredachi Inf., 14:2 (1978),  40–45
  8. Error Probability in a Channel with Fading and Signallike Noise

    Probl. Peredachi Inf., 13:1 (1977),  19–25
  9. Universal Stochastic Coding in Decision-Feedback Systems

    Probl. Peredachi Inf., 10:4 (1974),  25–29
  10. Optimal Decoding in Semicontinuous Channels with a Variable Parameter

    Probl. Peredachi Inf., 7:4 (1971),  22–29
  11. The Extended Hilbert Transformation and Its Application in Signal Theory

    Probl. Peredachi Inf., 5:4 (1969),  3–18
  12. An Estimate of $d_{\min}$ for Cyclic Codes

    Probl. Peredachi Inf., 2:2 (1966),  78
  13. The Correlation Between the Properties of a Binary Group Code and Those of its Null Space

    Probl. Peredachi Inf., 2:1 (1966),  91–95
  14. 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

  15. Letter to the editor

    Teor. Veroyatnost. i Primenen., 13:4 (1968),  755


© Steklov Math. Inst. of RAS, 2026