PROBLEMS OF INFORMATION TRANSMISSION
A translation of Problemy Peredachi Informatsii

CONTENTS                  

An Optimization Problem Related to the Computation of the Epsilon-entropy of an Ellipsoid in a Hamming Space
I. I. Dumer, M. S. Pinsker, and V. V. Prelov
pp. 99–112

Abstract—The problem of optimizing (finding the maximin of) the difference between the entropy functions of two $n$-dimensional vectors under special restrictions on their components is solved. This optimum gives the main term of the asymptotics for the $\varepsilon$-entropy of an ellipsoid in a Hamming space as the dimension of the space grows.

On the Epsilon-entropy of One Class of Ellipsoids in a Hamming Space
V. V. Prelov and E. C. van der Meulen
pp. 113–125

Abstract—Asymptotic behavior of the $\varepsilon$-entropy of ellipsoids in an $n$-dimensional Hamming space whose coefficients take only two different values is investigated as $n\to\infty$. Explicit expressions for the main terms of the asymptotic expansion of $\varepsilon$-entropy of such ellipsoids are obtained under various relations between $\varepsilon$ and parameters that define these ellipsoids.

Random Young Diagram, Variational Method, and Related Problems
V. M. Blinovsky
pp. 126–135

Abstract—Using the local method, we prove the large deviation principle for one model distribution, derive an explicit expression for the rate function, and outline ways to further apply the method presented.

Fast Jackson Networks with Dynamic Routing
Yu. M. Suhov and N. D. Vvedenskaya
pp. 136–153

Abstract—A new class of models of queueing networks with load-balanced dynamic routing is considered. We propose a sufficient condition for positive recurrence of the arising Markov process and a limiting mean-field approximation where the process becomes deterministic and is described by a system of nonlinear ordinary differential equations.

Joint Matrix Universal Coding of Sequences of Independent Symbols
Yu. M. Shtarkov
pp. 154–165

Abstract—Coding divergences of probability distributions are introduced. A method of joint matrix universal coding for a set of sequences of independent symbols with different statistics is proposed and studied. Two methods of multialphabet matrix coding are considered. The method proposed is compared with the PPM algorithm, and ways for integrating them are discussed.

On the 100th Anniversary since the Birth of Andrei Nikolaevich Kolmogorov
pp. 166–167