On error-free filtering of finite-state singular processes under dependent distortions V. V. PrelovE. C. van der Meulen Information Theory Pages: 271 - 279
On the construction of q-ary equidistant codes G. T. BogdanovaV. A. ZinovievT. J. Todorov Coding Theory Pages: 280 - 302
On the regularity of perfect 2-colorings of the Johnson graph I. Yu. Mogil’nykh Coding Theory Pages: 303 - 309
On partitions of an n-cube into nonequivalent perfect codes S. V. AvgustinovichF. I. Solov’evaO. Heden Coding Theory Pages: 310 - 315
On quasi-successful couplings of Markov processes M. L. BlankS. A. Pirogov Large Systems Pages: 316 - 330
Accumulation on the boundary for a one-dimensional stochastic particle system A. A. ZamyatinV. A. Malyshev Large Systems Pages: 331 - 343
Interrelation of characteristics of blocked RMA stack algorithms G. S. EvseevA. M. Turlikov Communication Network Theory Pages: 344 - 352
On the exact asymptotics for the stationary sojourn time distribution in a tandem of queues with light-tailed service times S. G. Foss Communication Network Theory Pages: 353 - 366
Application of data compression methods to nonparametric estimation of characteristics of discrete-time stochastic processes B. Ya. Ryabko Source Coding Pages: 367 - 379
Some mathematical questions of theory of information transmission M. S. Pinsker OriginalPaper Pages: 380 - 392