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
Interrelation of characteristics of blocked RMA stack algorithms G. S. EvseevA. M. Turlikov Communication Network Theory Pages: 344 - 352
Accumulation on the boundary for a one-dimensional stochastic particle system A. A. ZamyatinV. A. Malyshev Large Systems Pages: 331 - 343
On quasi-successful couplings of Markov processes M. L. BlankS. A. Pirogov Large Systems Pages: 316 - 330
On partitions of an n-cube into nonequivalent perfect codes S. V. AvgustinovichF. I. Solov’evaO. Heden Coding Theory Pages: 310 - 315
On the regularity of perfect 2-colorings of the Johnson graph I. Yu. Mogil’nykh Coding Theory Pages: 303 - 309
On the construction of q-ary equidistant codes G. T. BogdanovaV. A. ZinovievT. J. Todorov Coding Theory Pages: 280 - 302
On error-free filtering of finite-state singular processes under dependent distortions V. V. PrelovE. C. van der Meulen Information Theory Pages: 271 - 279
Multi-access system with many users: Stability and metastability N. D. VvedenskayaYu. M. Suhov Communication Network Theory Pages: 263 - 269
Exact asymptotics of distributions of integral functionals of the geometric Brownian motion and other related formulas V. R. Fatalov Large Systems Pages: 233 - 254
List decoding of the first-order binary Reed-Muller codes I. I. DumerG. A. KabatianskyC. Tavernier Coding Theory Pages: 225 - 232
Tilings of nonorientable surfaces by Steiner triple systems F. I. Solov’eva Coding Theory Pages: 213 - 224
Normalized information-based divergences J. -F. CoeurjollyR. DrouilhetJ. -F. Robineau Information Theory Pages: 167 - 189
Playout in slotted CBR networks: Single and multiple nodes A. Yu. PrivalovK. Sohraby Communication Network Theory Pages: 143 - 166
On reconstruction of information on an input word in a Medvedev permutation automaton given initial and final states A. V. Babash Automata Theory Pages: 132 - 142
Uniqueness of some optimal superimposed codes S. HongS. KapralovD. Y. Oh Coding Theory Pages: 113 - 123
On binary self-complementary [120, 9, 56] codes having an automorphism of order 3 and associated SDP designs I. BouyuklievS. BouyuklievaS. Dodunekov Coding Theory Pages: 89 - 96
Code spectrum and the reliability function: Gaussian channel M. V. Burnashev Information Theory Pages: 69 - 88
Random coding bound for the second moment of multidimensional lattices B. D. KudryashovK. V. Yurkov Source Coding Pages: 57 - 68
Bound on the cardinality of a covering of an arbitrary randomness test by frequency tests K. Yu. Gorbunov Large Systems Pages: 48 - 56
On resolvability of Steiner systems S(v = 2 m , 4, 3) of rank r ≤ v − m + 1 over \(\mathbb{F}_2 \) V. A. ZinovievD. V. Zinoviev Coding Theory Pages: 33 - 47
On ℤ4-linear codes with the parameters of Reed-Muller codes F. I. Solov’eva Coding Theory Pages: 26 - 32
Addendum to “Code spectrum and the reliability function: Binary symmetric channel” M. V. Burnashev Information Theory Pages: 23 - 25
On inequalities between mutual information and variation V. V. Prelov Information Theory Pages: 12 - 22
One-mode quantum Gaussian channels: Structure and quantum capacity A. S. Holevo Information Theory Pages: 1 - 11
Invariance of the stationary distribution of states of multimode service policy networks A. N. Starovoitov Communication Network Theory Pages: 371 - 378
On flows in simple bidirected and skew-symmetric networks M. A. Babenko Communication Network Theory Pages: 356 - 370
Self-averaging property of queuing systems A. A. VladimirovA. N. RybkoS. B. Shlosman Communication Network Theory Pages: 344 - 355
On-line estimation of smooth signals with partial observation P. L. ChowR. Z. Khasminskii Methods of Signal Processing Pages: 330 - 339
On the reliability exponent of the additive exponential noise channel Y. OvadiaS. I. Bross Information Theory Pages: 298 - 318
On the structure of optimal sets for a quantum channel M. E. Shirokov Information Theory Pages: 282 - 297
Code spectrum and the reliability function: Binary symmetric channel M. V. Burnashev Information Theory Pages: 263 - 281
Remark on “Recursive Aggregation of Estimators by the Mirror Descent Algorithm with Averaging” published in Probl. Peredachi Inf., 2005, no. 4 A. B. JuditskyA. V. NazinN. Vayatis Letters to the Editor Pages: 262 - 262
Distribution of investments in the stock market, information types, and algorithmic complexity V. V. V.’yuginV. P. Maslov Large Systems Pages: 251 - 261
Limit dynamics for stochastic models of data exchange in parallel computation networks A. G. Malyshkin Large Systems Pages: 234 - 250
Classification of steiner quadruple systems of order 16 and rank 14 V. A. ZinovievD. V. Zinoviev Coding Theory Pages: 217 - 229
The Grey-Rankin bound for nonbinary codes L. A. BassalygoS. M. DodunekovT. Helleseth Coding Theory Pages: 197 - 203
A different approach to finding the capacity of a Gaussian vector channel B. S. Tsybakov Information Theory Pages: 183 - 196
Error exponents for product convolutional codes C. MedinaV. R. SidorenkoV. V. Zyablov Information Theory Pages: 167 - 182
Remark on “On DNA Codes” published in Probl. Peredachi Inf., 2005, no. 4 A. G. D’yachkovP. A. VilenkinS. White Letters to the Editor 01 June 2006 Pages: 166 - 166
