A translation of Problemy Peredachi Informatsii

previous Volume 19, Number 4, October–December, 1983 next
Back to contents page


Characterization of Two Classes of Codes that Attain the Griesmer Bound   [View Abstract]
S. M. Dodunekov and N. L. Manev
pp. 253–259

Binary Self-Dual Codes with Automorphisms of Odd Order   [View Abstract]
V. I. Yorgov
pp. 260–270

Hadamard-Type Block Designs and Self-Dual Codes   [View Abstract]
V. D. Tonchev
pp. 270–274

Minimax Extrapolation of Sequences   [View Abstract]
G. K. Golubev and M. S. Pinsker
pp. 275–283

To the Theory of Discrete Signal Processing   [View Abstract]
S. D. Berman and I. I. Grushko
pp. 284–288

Existence and Uniqueness Conditions for a Random Field Describing the State of a Switching Network   [View Abstract]
M. Ya. Kel'bert and Yu. M. Sukhov
pp. 289–304

Random Multiple Access of “Impatient” Packets to a Broadcast Channel   [View Abstract]
B. S. Tsybakov and N. D. Vvedenskaya
pp. 305–313

Processes of Self-Assembly of Trees with Dependent Connections   [View Abstract]
M. L. Tai
pp. 313–319

pp. 321–326

(available in Russian only)

Restricted Asynchronous Multiple Access   [View Abstract]
L. A. Bassalygo and M. S. Pinsker
pp. 92–96 (Russian issue)

Universal Decoding for a Class of Deterministic Channels   [View Abstract]
A. V. Kuznetsov
pp. 97–100 (Russian issue)

On Derivation of Bispectra for Stationary Stochastic Process   [View Abstract]
V. A. Kalmykov
pp. 100–102 (Russian issue)

Improvement of the Code-Length Lower Bound for a Multiple-Access Adder Channel   [View Abstract]
A. G. Dyachkov and V. V. Rykov
pp. 103–105 (Russian issue)