A translation of Problemy Peredachi Informatsii

previous Volume 21, Number 2, April–June, 1985 next
Back to contents page

CONTENTS                   Powered by MathJax

On Nonstochastic Objects   [View Abstract]
V. V. V'yugin
pp. 77–83

On Code Distances of Some Classes of $(p,p)$-Codes   [View Abstract]
B. Brindza
pp. 83–91

New Upper Bounds for Decoding Error Probability for Convolutional Codes   [View Abstract]
K. Sh. Zigangirov
pp. 92–101

Statistical Synthesis of Optimal Processing Algorithms for Series of Atmospherically Distorted “Speckle” Images of Astronomical Objects   [View Abstract]
P. A. Bakut, S. D. Pol'skikh, A. D. Ryakhin, K. N. Sviridov, and N. D. Ustinov
pp. 102–110

On Spectral Density Estimates for Some Models of Stationary Stochastic Processes   [View Abstract]
V. G. Alekseev
pp. 110–116

Uniform Estimation of an Unknown Probability Distribution Density   [View Abstract]
M. B. Nevel'son
pp. 117–124

On Properties of Estimation Algorithms for Binary Sequences   [View Abstract]
S. T. Grinchenko and N. D. Tarankova
pp. 125–134

Some New Random Multiple-Access Algorithms   [View Abstract]
B. S. Tsybakov and N. B. Likhanov
pp. 134–153

Analysis of a Fully Connected Message-Switching Communication Network with a Large Number of Nodes, Bypass Routes, and a Limited Number of Waiting Places at Nodes   [View Abstract]
V. V. Marbukh
pp. 154–161

(available in Russian only)

Necessary and Sufficient Conditions for Recurrency of a Markov System in Terms of Liapunov Functions   [View Abstract]
V. A. Lazarev
pp. 99–102 (Russian issue)

Optimum Codes Correcting Lattice Errors   [View Abstract]
E. M. Gabidulin
pp. 103–108 (Russian issue)