RUS
ENG
Full version
JOURNALS
// Problemy Peredachi Informatsii
// Archive
1983, Volume 19, Issue 1
Information Theory and Coding Theory
On Decoding Complexity for Linear Codes
G. S. Evseev
3
Random-Coding Bounds for Some Broadcast Channels
G. Sh. Poltyrev
9
Combined Decoding Methods for Linear Codes with Unequal Protection of Information Symbols
I. M. Boyarinov
21
Methods of Signal Processing
Analysis of the Efficiency of Some Controlled Search Procedures
N. A. Ivanchuk
30
Investigation of Monotonicity of Various Criteria of Informativeness
L. G. Malinovskii
40
Class of Fast Fourier Transform Algorithms for a Real Sequence
G. V. Zaitsev, N. E. Nagulin
49
Communication Network Theory
Bounds for Packet Transmission Rate in a Random-Multiple-Access System
B. S. Tsybakov, V. A. Mikhailov, N. B. Likhanov
61
Properties of Probability Characteristics of a Communications Network with Repeat Calls
S. N. Stepanov
82
Information in Living Systems
Stable Single-Locus Polyallele Populations
L. A. Kun, L. N. Lupichev
91
Ņorrespondence
On Computability of the Parameter in a Bernoulli Scheme
V. V. V'yugin
100
Equivalence of Hierarchies of Index Grammars and Macrogrammars
A. N. Maslov
106
©
Steklov Math. Inst. of RAS
, 2025