![]() |
|
JOURNALS // Problemy Peredachi Informatsii // Archive |
2019, Volume 55, Issue 3
|
Information Theory | |||
![]() |
Upper bounds for the Holevo quantity and their use M. E. Shirokov |
3 | |
![]() |
Optimal upper bounds for the divergence of finite-dimensional distributions under a given variational distance V. V. Prelov |
21 | |
Coding Theory | |||
![]() |
Divisible arcs, divisible codes, and the extension problem for arcs and codes I. N. Landjev, A. P. Rousseva |
30 | |
![]() |
Generalization of IPP codes and IPP set systems E. E. Egorova |
46 | |
![]() |
Some L. Li, S. Zhu, L. Liu, X. Kai |
60 | |
![]() |
On alphabetic coding for superwords S. S. Marchenkov |
83 | |
![]() |
Traceability codes and their generalizations G. A. Kabatiansky |
93 | |
Large Systems | |||
![]() |
Note on “Smaller explicit superconcentrators” by N. Alon and M. Capalbo L. A. Bassalygo |
106 | |
Errata | |||
![]() |
Erratum to: “On completely regular codes” [Problemy Peredachi Informatsii 55, no. 1, 3–50 (2019)] J. Borges, J. Rifà, V. A. Zinoviev |
109 | |
![]() |
Erratum to: “The geometry of big queues” [Problemy Peredachi Informatsii 55, no. 2, 82–111 (2019)] A. A. Puhalskii |
110 |