A translation of Problemy Peredachi Informatsii

previous Volume 31, Number 1, January–March, 1995 next
Back to contents page


An Effective Method for Encoding Information Sources Using the Fast Muliplication Algorithm   [View Abstract]
B. Ya. Ryabko
pp. 1–9

Upper Bounds on the Probability of Nondetected Error   [View Abstract]
G. L. Katsman
pp. 10–13

Asymptotics of Fisher Information Under Weak Perturbation   [View Abstract]
V. V. Prelov and E. C. van der Meulen
pp. 14–22

Application of Formal Grammars for Encoding Information Sources   [View Abstract]
E. V. Kourapova and B. Ya. Ryabko
pp. 23–26

Image Processing for Plane Domains: Change-Point Problems for the Domain's Area   [View Abstract]
M. I. Freidlin and A. P. Korostelev
pp. 27–45

Lower Information Bounds for Adaptive Tracking of a Linear Discrete Plant   [View Abstract]
A. V. Nazin and A. B. Juditski
pp. 46–56

Filtration of Time-Continuous Stochastic Signals by Discrete Observations With Memory   [View Abstract]
O. L. Abakumova, N. S. Demin, and T. V. Sushko
pp. 57–71

Unimodality of the Distribution of the Number of Pulses for Gaussian Optical Fields   [View Abstract]
Yu. P. Virchenko and A. S. Mazmanishvili
pp. 72–77

On the Limit Distribution of the Distance Between a Random Vector and Some Binary Codes   [View Abstract]
S. I. Chechiota
pp. 78–85

Recurrence Method for Teletraffic Evaluation in Serial-Parallel Telecommunication Nets   [View Abstract]
A. V. Klimov, S. A. Kolbasyuk, and V. I. Neiman
pp. 86–97