RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

1966, Volume 2, Issue 2


Optimal Coding in the Case of Unknown and Changing Message Statistics
B. M. Fitingof
3
Estimate of the Complexity of Sequential Decoding of Random Tree Codes
V. N. Koshelev
12
On the Convolution of Information in a Classical Probability Scheme
A. Yu. Lev, D. P. Mil'man, V. D. Milman
29
Arithmetic Codes with Determination of the Place of Error
Yu. G. Dadaev
39
Zero-Sum Games for Two Asymptotically Optimal Sequences of Automata
V. I. Krinskii
43
Noise-Resistant State Assignment Method for Asynchronous Finite Automata
Yu. L. Sagalovich
54
Photon Channels with Small Occupation Numbers
L. B. Levitin
60
Statistical Properties of Polarization Parameters of Radio Signals and Noise
A. P. Rodimov
69

Ņorrespondence
An Inverse Problem in Information Theory
V. Ya. Rozenberg, N. A. Rubichev
76
An Estimate of $d_{\min}$ for Cyclic Codes
V. I. Korzhik
78
The Calculation of the Loss Probability in Schemes Constructed from Complete Access Groups
G. L. Ionin, Ya. Ya. Rachevskii
79


© Steklov Math. Inst. of RAS, 2025