A translation of Problemy Peredachi Informatsii

previous Volume 7, Number 1, January–March, 1971 next
Back to contents page


On the Twenty-Fourth Congress of the Communist Party of the Soviet Union
pp. 1–2

An Estimate of the Complexity of Constructing Binary Linear Cascade Codes   [View Abstract]
V. V. Zyablov
pp. 3–10

Weight Spectrum of Binary Bose–Chaudhuri–Hoquinghem Codes   [View Abstract]
V. M. Sidel'nikov
pp. 11–17

Complexity of Circuit Implementation of Reed’s Algorithm and Decoding in an Automaton   [View Abstract]
Yu. L. Sagalovich
pp. 18–22

Sequential Decoding in a Channel with Error Bursts   [View Abstract]
K. Sh. Zigangirov and V. V. Ovchinnikov
pp. 23–29

Uniformly Packed Codes   [View Abstract]
N. V. Semakov, V. A. Zinoviev, and G. V. Zaitsev
pp. 30–39

An Information-Theoretic Approach to Statistical Decision Problems   [View Abstract]
P. A. Bakut
pp. 40–45

Optimum Reception of Pulse Radio Signals with Secondary Frequency Modulation   [View Abstract]
M. S. Yarlykov
pp. 46–52

Approximation Possibilities of Minimum-Phase Networks   [View Abstract]
A. A. Lanne and N. I. Zhivitsa
pp. 53–58

A Program which Constructs a Multistage Classification   [View Abstract]
A. V. Rashkinis
pp. 59–68

Formal Grammars and Constraints on Derivation   [View Abstract]
E. D. Stotskii
pp. 69–81

A Strong Converse of Shannon’s Theorem for Memoryless Channels with Synchronization Errors   [View Abstract]
O. K. Kozlov
pp. 82–84

Relationship between Chromatic Number and Branch Connectivity in a Finite Graph   [View Abstract]
V. P. Polesskii
pp. 85–87

One Queueing System with Nonstationary Incoming Flow   [View Abstract]
D. G. Polyak
pp. 88–90