A translation of Problemy Peredachi Informatsii

previous Volume 12, Number 4, October–December, 1976 next
Back to contents page

CONTENTS                   Powered by MathJax

Ordering of Information Criteria for Discrimination of Probability Distributions   [View Abstract]
A. A. Amosov and V. V. Kolpakov
pp. 245–250

Data Transmission over a Discrete Channel with Feedback. Random Transmission Time   [View Abstract]
M. V. Burnashev
pp. 250–265

On One General Bound for Code Volume   [View Abstract]
E. M. Gabidulin and V. R. Sidorenko
pp. 266–269

On One Approach to the Decoding of Bose–Chaudhuri–Hocquingham Codes   [View Abstract]
E. F. Skvortsov and Yu. V. Sulimov
pp. 270–277

On Bounds on the Number of Code Words in Binary Arithmetic Codes   [View Abstract]
G. A. Kabatyanskii
pp. 277–283

Cyclic Code that Corrects Double Bursts of Arithmetic Errors   [View Abstract]
G. L. Tauglich
pp. 284–289

On Optimum Generators of Convolutional Codes with Rate $R=1/2$   [View Abstract]
I. N. Karbovskii and G. M. Karbovskaya
pp. 290–296

Sequences of Maximum Length as Automaton State Codes   [View Abstract]
Yu. L. Sagalovich
pp. 296–299

One-Dimensional Automaton Networks with Monotonic Local Interaction   [View Abstract]
G. A. Gal'perin
pp. 299–310

Loopless Decomposition of Probabilistic Automata   [View Abstract]
A. Kh. Giorgadze, G. E. Yakobson, and L. V. Burshtein
pp. 310–315

Isthmus Structure in a Summary Matroid   [View Abstract]
V. P. Polesskii
pp. 315–322

Formalization of the Problem of Complexity of Code Specification   [View Abstract]
L. A. Bassalygo
pp. 322–324

Determination of Cyclic Representatives of Cyclic Codes   [View Abstract]
A. P. Kurdyukov
pp. 325–326

pp. 327–333