A translation of Problemy Peredachi Informatsii

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

CONTENTS                   Powered by MathJax

Optimal Coding in the Case of Unknown and Changing Message Statistics   [View Abstract]
B. M. Fitingof
pp. 1–7

Estimate of the Complexity of Sequential Decoding of Random Tree Codes   [View Abstract]
V. N. Koshelev
pp. 8–20

On the Convolution of Information in a Classical Probability Scheme   [View Abstract]
A. Yu. Lev, D. P. Mil'man, and V. D. Mil'man
pp. 21–28

Arithmetic Codes with Determination of the Place of Error   [View Abstract]
Yu. G. Dadaev
pp. 29–32

Zero-Sum Games for Two Asymptotically Optimal Sequences of Automata   [View Abstract]
V. I. Krinskii
pp. 33–41

Noise-Resistant State Assignment Method for Asynchronous Finite Automata   [View Abstract]
Yu. L. Sagalovich
pp. 42–47

Photon Channels with Small Occupation Numbers   [View Abstract]
L. B. Levitin
pp. 48–56

Statistical Properties of Polarization Parameters of Radio Signals and Noise   [View Abstract]
A. P. Rodimov
pp. 57–62

An Inverse Problem in Information Theory   [View Abstract]
V. Ya. Rozenberg and N. A. Rubichev
pp. 63–64

An Estimate of $d_{\min}$ for Cyclic Codes   [View Abstract]
V. I. Korzhik
p. 65

The Calculation of the Loss Probability in Schemes Constructed from Complete Access Groups   [View Abstract]
G. L. Ionin and Ya. Ya. Rachevskii
pp. 66–69