2-years impact-factor Math-Net.Ru of «Problemy Peredachi Informatsii» journal, 2021

2-years impact-factor Math-Net.Ru of the journal in 2021 is calculated as the number of citations in 2021 to the scientific papers published during 2019–2020.

The table below contains the list of citations in 2021 to the papers published in 2019–2020. We take into account all citing publications we found from different sources, mostly from references lists available on Math-Net.Ru. Both original and translation versions are taken into account.

The impact factor Math-Net.Ru may change when new citations to a year given are found.

1 2 3 4  Full list
N	Citing pulication		Cited paper
1.	A. M. Romanov, “O sovershennykh kodakh i kodakh Rida–Mallera nad konechnymi polyami”, Probl. peredachi inform., 57:3 (2021), 3–16	→	On completely regular codes J. Borges, J. Rifà, V. A. Zinoviev Probl. Peredachi Inf., 55:1 (2019),  3–50
2.	D. S. Krotov, V. N. Potapov, “On multifold packings of radius-1 balls in Hamming graphs”, IEEE Trans. Inf. Theory, 67:6 (2021), 3585–3598	→	On completely regular codes J. Borges, J. Rifà, V. A. Zinoviev Probl. Peredachi Inf., 55:1 (2019),  3–50
3.	D. R. Hawtin, “S-elusive codes in Hamming graphs”, Designs Codes Cryptogr., 89:6 (2021), 1211–1220	→	On completely regular codes J. Borges, J. Rifà, V. A. Zinoviev Probl. Peredachi Inf., 55:1 (2019),  3–50
4.	E. A. Bespalov, D. S. Krotov, A. A. Matiushev, A. A. Taranenko, K. V. Vorob'ev, “Perfect 2-colorings of Hamming graphs”, J. Comb Des., 29:6 (2021), 367–396	→	On completely regular codes J. Borges, J. Rifà, V. A. Zinoviev Probl. Peredachi Inf., 55:1 (2019),  3–50
5.	Ivan Mogilnykh, 2021 International Conference Automatics and Informatics (ICAI), 2021, 230	→	On completely regular codes J. Borges, J. Rifà, V. A. Zinoviev Probl. Peredachi Inf., 55:1 (2019),  3–50
6.	A. A. Zatsarinnyy, A. P. Shabanov, “Method of centralized reproduction of information transmission processes in the digital platform control loop”, 14th International Symposium Intelligent Systems, Procedia Computer Science, 186, eds. I. Zelinka, F. Pereira, S. Das, A. Ilin, A. Diveev, E. Nikulchev, Elsevier Science Bv, 2021, 63–69	→	Reliable communication under the influence of a state-constrained jammer: an information-theoretic perspective on receive diversity C. Arendt, J. Nötzel, H. Boche Probl. Peredachi Inf., 55:2 (2019),  3–27
7.	S. V. Kozlov, A. N. Kubankov, A. P. Shabanov, 2021 Wave Electronics and its Application in Information and Telecommunication Systems (WECONF), 2021, 1	→	Reliable communication under the influence of a state-constrained jammer: an information-theoretic perspective on receive diversity C. Arendt, J. Nötzel, H. Boche Probl. Peredachi Inf., 55:2 (2019),  3–27
8.	D. Koshelev, “Hashing to elliptic curves of j-invariant 1728”, Cryptogr. Commun., 13:4, SI (2021), 479–494	→	Non-split toric codes D. I. Koshelev Probl. Peredachi Inf., 55:2 (2019),  28–49
9.	V. A. Zinovev, D. V. Zinovev, “Ob obobschennoi kaskadnoi konstruktsii kodov v modulnoi metrike i metrike Li”, Probl. peredachi inform., 57:1 (2021), 81–95	→	On application of the modulus metric to solving the minimum Euclidean distance decoding problem V. А. Davydov Probl. Peredachi Inf., 55:2 (2019),  50–57
10.	E. E. Egorova, G. A. Kabatyanskii, “Razdelimye kody dlya zaschity multimedia ot nelegalnogo kopirovaniya koalitsiyami”, Probl. peredachi inform., 57:2 (2021), 90–111	→	Generalization of IPP codes and IPP set systems E. E. Egorova Probl. Peredachi Inf., 55:3 (2019),  46–59
11.	Kirill Vedenev, Yury Kosolapov, 2021 XVII International Symposium "Problems of Redundancy in Information and Control Systems" (REDUNDANCY), 2021, 55	→	Generalization of IPP codes and IPP set systems E. E. Egorova Probl. Peredachi Inf., 55:3 (2019),  46–59
12.	Nopendri, Alamsyah I.M., Suprijanto D., Barra A., “Cyclic codes from a sequence over finite fields”, Eur. J. Pure Appl Math., 14:3 (2021), 685–694	→	Some $q$-ary cyclic codes from explicit monomials over $\mathbb{F}_{q^m}$ L. Li, S. Zhu, L. Liu, X. Kai Probl. Peredachi Inf., 55:3 (2019),  60–82
13.	Boris Melnikov, Aleksandra Melnikova, Lecture Notes in Networks and Systems, 228, Informatics and Cybernetics in Intelligent Systems, 2021, 365	→	On alphabetic coding for superwords S. S. Marchenkov Probl. Peredachi Inf., 55:3 (2019),  83–92
14.	E. E. Egorova, G. A. Kabatyanskii, “Razdelimye kody dlya zaschity multimedia ot nelegalnogo kopirovaniya koalitsiyami”, Probl. peredachi inform., 57:2 (2021), 90–111	→	Traceability codes and their generalizations G. A. Kabatiansky Probl. Peredachi Inf., 55:3 (2019),  93–105
15.	V. M. Deundyak, D. V. Zagumennov, “O granitsakh moschnosti zloumyshlennikov dlya identifitsiruyuschikh algebrogeometricheskikh kodov na spetsialnykh krivykh”, PDM, 2021, № 53, 55–74	→	Traceability codes and their generalizations G. A. Kabatiansky Probl. Peredachi Inf., 55:3 (2019),  93–105
16.	V. M. Deundyak, D. V. Zagumennov, “On the properties of algebraic geometric codes as copy protection codes”, Autom. Control Comp. Sci., 55:7 (2021), 795–808	→	Traceability codes and their generalizations G. A. Kabatiansky Probl. Peredachi Inf., 55:3 (2019),  93–105
17.	Kirill Vedenev, Yury Kosolapov, 2021 XVII International Symposium "Problems of Redundancy in Information and Control Systems" (REDUNDANCY), 2021, 55	→	Traceability codes and their generalizations G. A. Kabatiansky Probl. Peredachi Inf., 55:3 (2019),  93–105
18.	G. Vazquez-Vilar, “Error probability bounds for Gaussian channels under maximal and average power constraints”, IEEE Trans. Inf. Theory, 67:6 (2021), 3965–3985	→	The Augustin capacity and center B. Nakiboğlu Probl. Peredachi Inf., 55:4 (2019),  3–51
19.	M. Mosonyi, T. Ogawa, “Divergence radii and the strong converse exponent of classical-quantum channel coding with constant compositions”, IEEE Trans. Inf. Theory, 67:3 (2021), 1668–1698	→	The Augustin capacity and center B. Nakiboğlu Probl. Peredachi Inf., 55:4 (2019),  3–51
20.	S. Verdu, “Error exponents and alpha-mutual information”, Entropy, 23:2 (2021), 199	→	The Augustin capacity and center B. Nakiboğlu Probl. Peredachi Inf., 55:4 (2019),  3–51
1 2 3 4  Full list