A translation of Problemy Peredachi Informatsii

previous Volume 20, Number 1, January–March, 1984 next
Back to contents page


On Shortening of Codes   [View Abstract]
V. A. Zinov'ev and S. N. Litsyn
pp. 1–7

Minimum Possible Block Length of a Linear Binary Code for Some Distances   [View Abstract]
S. M. Dodunekov and N. L. Manev
pp. 8–14

Choice of Coding System for Error Protection of Storage Devices   [View Abstract]
Yu. L. Sagalovich and N. S. Shcherbakov
pp. 14–20

Multidimensional Signals for a Continuous Channel   [View Abstract]
V. V. Ginzburg
pp. 20–34

Modular Curves and Codes with Polynomial Construction Complexity   [View Abstract]
S. G. Vlǎduţ, G. L. Katsman, and M. A. Tsfasman
pp. 35–42

On Minimax Estimation of Regression   [View Abstract]
G. K. Golubev
pp. 42–49

Median Filtering of Random Processes   [View Abstract]
L. I. Piterbarg
pp. 49–55

On the Lower Bound for the Number of States of Deterministic Intelligent Automata   [View Abstract]
A. N. Boiko
pp. 56–63

Stability of Asynchronous ALOHA System   [View Abstract]
B. S. Tsybakov and V. L. Bakirov
pp. 63–72

Discrete-Time Single-Server System with Requests of Several Types   [View Abstract]
G. P. Basharin and V. A. Efimushkin
pp. 73–80

(available in Russian only)

Comparision of Decoding Comlexity for Truncated Convolutional Codes and Block Codes   [View Abstract]
V. V. Zyablov and S. A. Shavgulidze
pp. 105–109 (Russian issue)