PROBLEMS OF INFORMATION TRANSMISSION
A translation of Problemy Peredachi Informatsii

CONTENTS

New Sufficient Existence Conditions for Codes Meeting the Varshamov–Greismer Bound   [View Abstract]
V. N. Logachev
pp. 77–98

Zero-Error Capacity of Memoryless Channels with Weak Input Signals   [View Abstract]
V. V. Prelov
pp. 98–104

New Asymptotic Lower Bounds on the Free Distance of Time-Invariant Convolutional Codes   [View Abstract]
K. Sh. Zigangirov
pp. 104–111

On Weight Spectra of Some Codes   [View Abstract]
I.E. Shparlinskii
pp. 111–116

Local-Area Network with Random-Multiple-Access Stack Algorithm   [View Abstract]
B. S. Tsybakov and S. P. Fedortsov
pp. 117–125

Queuing Networks with Regenerating Trajectories   [View Abstract]
A. L. Tolmachev
pp. 125–132

Robust Reconstruction of Functions by the Local-Approximation Method   [View Abstract]
A. B. Tsybakov
pp. 133–146

Synthesis of Self-Checking Checkers for Summation Codes   [View Abstract]
A. G. Mel'nikov, V. V. Sapozhnikov, and Vl. V. Sapozhnikov
pp. 146–157

BRIEF COMMUNICATIONS
(available in Russian only)

Fast Correlation Decoding of p-ary Codes of Maximal Length   [View Abstract]
L. V. Kanatova, V. L. Litvinov, and L. M. Fink
pp. 98–103 (Russian issue)

Throughput Analysis for a Noise-Resistant Multiple Access Algorithm   [View Abstract]
G. S. Evseev and A. M. Turlikov
pp. 104–109 (Russian issue)