PROBLEMS OF INFORMATION TRANSMISSION
A translation of Problemy Peredachi Informatsii

CONTENTS                  

A Class of Cyclic Codes with a Majority Decoding Scheme
V. L Dyn'kin and G. M. Tenengol'ts
pp. 1–11

Abstract—A new class of binary codes which can be orthogonalized in two steps is studied.

Some $k$-Valued Pseudo-random Sequences and Nearly Equidistant Codes
V. M. Sidel'nikov
pp. 12–16

Abstract—We consider pseudorandom sequences $\alpha$ of length $n$ in which the elements are the $k$-th order roots of unity. We show that for any $k$ and $n=q-1$, $q\equiv 1\pmod{\!k}$ ($q$ is a power of a prime $p$), there exist pseudorandom sequences $\alpha$ with autocorrelation function $T(m)$, whose modulus does not exceed $4$. In addition we consider nearly equidistant codes which can be obtained from the pseudorandom sequences considered.

Upper and Lower Bounds for the Probability of Error in Decoding for Discrete Channels
V. M. Egarmin
pp. 17–32

Abstract—The lower bound for the probability of error for discrete channels with memory is determined. It is shown that the Gallager upper boundary and the lower boundary obtained in the paper are asymptotically exact for channels with Markov noise with transmission rates close to the channel capacity. For certain models of binary channels which are additive $\bmod 2$, upper bounds for the probability of error are determined.

Bounds for the Probability of Error for Certain Channels with Memory
E. M. Gabidulin
pp. 33–38

Abstract—It is shown that for three types of channel the well known methods for approximating channels with memory by memoryless channels make it possible to compute the channel capacity and to obtain upper and lower bounds for the probability of error. For a Shannon channel with a finite number of states which are computable at both ends, the reliability function is computed in explicit form.

Noise Immunity of a Method of Coherent Signal Addition in a Multipath Channel with Incomplete Path Separation
M. A. Bykhovskii
pp. 39–45

Abstract—Relations ate obtained which make it possible to allow for the effect of signal shape on the noise immunity of reception of discrete information in channels with frequency-selective and time fading. The results make possible an intelligent choice of signals for communication systems involving such channels.

Certain Suboptimal Devices for the Detection of Fluctuating Poisson Signals
N. A. Dolinin and A. F. Terpugov
pp. 46–58

Abstract—Quadratic arrangements for the detection of light signals are studied theoretically. Formulas for the probability of errors of the false-alarm and target-miss type are derived.

Some Aspects of the Theory of Automata with Variable Structure
G. A. Agasandyan
pp. 59–64

Abstract—Aspects of the representability of regular events in automata with variable structure (AVS) and some experiments are considered. An efficient procedure is given for the construction of a minimal automaton with periodic structure from a given finite automaton, and also an algorithm for finding the word which solves the problem of the simplest experiment on recognition of the state of such an AVS.

Coding the States of a Finite Automaton
N. K. Nemsadze
pp. 65–70

Abstract—The lower bound of the number $n$ of internal elements (storage elements) of an automaton is deduced, subject to the condition that the automaton is stable to critical race conditions and to defects in its internal elements. A simple method of coding the internal states of the automaton is given; it enables the lower bound to be attained in a number of cases. For other cases an algorithm for coding the internal states of the automaton is deduced in which, although $n$ attains a minimal value, the inspection is not the last item.

Stabilization of a Linear System by Indirect Control in the Presence of Random Noise
M. B. Nevel'son
pp. 71–76

Abstract—We study a linear control system in which random noise can influence only the rate of change of the control. Assuming that the corresponding deterministic system is completely controllable, we isolate a class of random noise processes for which it is possible to stabilize (in some sense or another) the given stochastic system.

Memory Increases Transmission Capacity
R. L. Dobrushin and M. S. Pinsker
pp. 77–78

Abstract—It is shown that the transmission capacity of a channel with memory is not less than the capacity of a memoryless channel.

The Epsilon-Entropy of a Vector Message
B. S. Tsybakov
pp. 78–79

Abstract—An expression is sought for the least channel transmission capacity necessary for transmitting a vector message with a given mean-square accuracy criterion.

Use of Game-Theory Methods for Recognition of Two Objects in Noisy Channels
V. F. Nesteruk
pp. 80–82

Abstract—A solution is given of the simplest problem of recognizing two objects when signals are transmitted over a channel with transforming noise, optimal strategies are found, and the behavior of the performance index of the recognition system is studied.