PROBLEMS OF INFORMATION TRANSMISSION
A translation of Problemy Peredachi Informatsii

CONTENTS                  

On the Smallest Size of an Almost Complete Subset of a Conic in $\operatorname{PG}(2,q)$ and Extendability of Reed–Solomon Codes   [View Abstract]
D. Bartoli, A. A. Davydov, S. Marcugini, and F. Pambianco
pp. 101–115

Compositional Restricted Multiple Access Channel   [View Abstract]
E. E. Egorova and V. S. Potapova
pp. 116–123

On Discrimination between Classes of Distribution Tails   [View Abstract]
I. V. Rodionov
pp. 124–138

Improved Frankl–Rödl Theorem and Some of Its Geometric Consequences   [View Abstract]
A. A. Sagdeev
pp. 139–164

Clique Numbers of Random Subgraphs of Some Distance Graphs   [View Abstract]
A. S. Gusev
pp. 165–175

Maximum Remaining Service Time in Infinite-Server Queues   [View Abstract]
A. V. Lebedev
pp. 176–190

Information-Theoretic Approach to Estimating the Capacity of Distributed Memory Systems   [View Abstract]
B. Ya. Ryabko
pp. 191–198