Problemy Peredachi Informatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Most published authors (scientific articles only) of the journal

scientific articles published in peer review journal, serial, conference publications, indexed in international bibliographical databases and/or having DOI index
1. M. Sh. Pinsker 69
2. V. A. Zinov'ev 66
3. B. S. Tsybakov 65
4. V. V. Zyablov 57
5. L. A. Bassalygo 49
6. M. V. Burnashev 45
7. V. V. Prelov 44
8. K. Sh. Zigangirov 39
9. B. Ya. Ryabko 32
10. G. K. Golubev 31
11. V. M. Blinovskii 30
12. R. Z. Khas'minskii 30
13. V. S. Lebedev 27
14. A. G. D'yachkov 24
15. V. G. Alekseev 23
16. Yu. L. Sagalovich 23
17. D. V. Zinov'ev 22
18. G. A. Kabatiansky 21
19. F. I. Solov'eva 21
20. N. D. Vvedenskaya 20
21. V. P. Polesskii 20
40 most published authors of the journal

Most cited authors of the journal
1. Yu. I. Pastukhova 613
2. A. S. Holevo 602
3. V. A. Zinov'ev 459
4. M. V. Burnashev 250
5. V. V. Zyablov 215
6. M. Sh. Pinsker 209
7. K. Sh. Zigangirov 208
8. F. I. Solov'eva 194
9. A. J. Winter 191
10. È. M. Gabidulin 180
11. L. A. Bassalygo 177
12. N. D. Vvedenskaya 160
13. N. Cai 160
14. R. L. Dobrushin 159
15. R. W. Yeung 159
16. D. V. Zinov'ev 144
17. M. E. Shirokov 140
18. B. Ya. Ryabko 138
19. V. M. Blinovskii 134
20. A. G. D'yachkov 134
40 most cited authors of the journal

Most cited articles of the journal
1. Nonparametric Estimation of Linear Functionals of the Regression Function for a Known Conditional Distribution of the Observation Noise
Yu. I. Pastukhova
Probl. Peredachi Inf., 1999, 35:2, 67–74 		612
2. Quantum Privacy and Quantum Wiretap Channels
N. Cai, A. Winter, R. W. Yeung
Probl. Peredachi Inf., 2004, 40:4, 26–47 		159
3. Almost Independence and Secrecy Capacity
I. Csiszár
Probl. Peredachi Inf., 1996, 32:1, 48–57 		122
4. Queueing System with Selection of the Shortest of Two Queues: An Asymptotic Approach
N. D. Vvedenskaya, R. L. Dobrushin, F. I. Karpelevich
Probl. Peredachi Inf., 1996, 32:1, 20–34 		117
5. Single-Mode Quantum Gaussian Channels: Structure and Quantum Capacity
A. S. Holevo
Probl. Peredachi Inf., 2007, 43:1, 3–14 		115
6. Entanglement-Breaking Channels in Infinite Dimensions
A. S. Holevo
Probl. Peredachi Inf., 2008, 44:3, 3–18 		111
7. Codes for the $m$-Metric
M. Yu. Rosenbloom, M. A. Tsfasman
Probl. Peredachi Inf., 1997, 33:1, 55–63 		111
8. On the Additivity Conjecture in Quantum Information Theory
G. G. Amosov, A. S. Holevo, R. F. Werner
Probl. Peredachi Inf., 2000, 36:4, 25–34 		103
9. Secrecy results for compound wiretap channels
I. Bjelaković, H. Boche, J. Sommerfeld
Probl. Peredachi Inf., 2013, 49:1, 83–111 		98
10. Using Literal and Grammatical Statistics for Authorship Attribution
O. V. Kukushkina, A. A. Polikarpov, D. V. Khmelev
Probl. Peredachi Inf., 2001, 37:2, 96–109 		94
11. Three approaches to the definition of the concept “quantity of information”
A. N. Kolmogorov
Probl. Peredachi Inf., 1965, 1:1, 3–11 		81
12. New Technique for Decoding Codes in the Rank Metric and Its Cryptography Applications
A. V. Urivskii, T. Johansson
Probl. Peredachi Inf., 2002, 38:3, 83–93 		73
13. A Metric for Codes over Residue Class Rings
I. Constantinescu, W. Heise
Probl. Peredachi Inf., 1997, 33:3, 22–28 		72
14. Bounds for the Quantity of Information Transmitted by a Quantum Communication Channel
A. S. Holevo
Probl. Peredachi Inf., 1973, 9:3, 3–11 		70
15. Recursive Aggregation of Estimators by Mirror Descent Algorithm with Averaging
A. B. Yuditskii, A. V. Nazin, A. B. Tsybakov, N. Vayatis
Probl. Peredachi Inf., 2005, 41:4, 78–96 		62
16. Theory of Codes with Maximum Rank Distance
È. M. Gabidulin
Probl. Peredachi Inf., 1985, 21:1, 3–16 		62
17. Method for the Fast Fourier Transform Evaluation over a Finite Field
P. V. Trifonov, S. V. Fedorenko
Probl. Peredachi Inf., 2003, 39:3, 3–10 		53
18. The Exponential Distribution in Information Theory
S. Verdú
Probl. Peredachi Inf., 1996, 32:1, 100–111 		51
19. To the Theory of Low-Density Convolutional Codes. II
M. Lentmaier, D. V. Trukhachev, K. Sh. Zigangirov
Probl. Peredachi Inf., 2001, 37:4, 15–35 		49
20. Research on fractional critical covered graphs
S. Wang, W. Zhang
Probl. Peredachi Inf., 2020, 56:3, 77–85 		43
40 most cited articles of the journal

Most requested articles of the journal
| one week | one month | one year | all time |
1. Codes Correcting Errors of Large Weight in Lee Metric
L. E. Mazur
Probl. Peredachi Inf., 1973, 9:4, 11–16 		51
2. Sample Estimate of the Entropy of a Random Vector
L. F. Kozachenko, N. N. Leonenko
Probl. Peredachi Inf., 1987, 23:2, 9–16 		46
3. Universal Sequential Search Problems
L. A. Levin
Probl. Peredachi Inf., 1973, 9:3, 115–116 		41
4. Three approaches to the definition of the concept “quantity of information”
A. N. Kolmogorov
Probl. Peredachi Inf., 1965, 1:1, 3–11 		37
5. Markov Processes over Denumerable Products of Spaces, Describing Large Systems of Automata
L. N. Vaserstein
Probl. Peredachi Inf., 1969, 5:3, 64–72 		23
6. Bounds for the Quantity of Information Transmitted by a Quantum Communication Channel
A. S. Holevo
Probl. Peredachi Inf., 1973, 9:3, 3–11 		22
7. Theory of Codes with Maximum Rank Distance
È. M. Gabidulin
Probl. Peredachi Inf., 1985, 21:1, 3–16 		21
8. The Exponential Distribution in Information Theory
S. Verdú
Probl. Peredachi Inf., 1996, 32:1, 100–111 		20
9. Scalar-Matrix Differentiation and Its Applications to Constructive Problems of Communication Theory
A. A. Amosov, V. V. Kolpakov
Probl. Peredachi Inf., 1972, 8:1, 3–15 		18
10. Upper bounds on the smallest size of a complete arc in $PG(2,q)$ under a certain probabilistic conjecture
D. Bartoli, A. A. Davydov, G. Faina, A. A. Kreshchuk, S. Marcugini, F. Pambianco
Probl. Peredachi Inf., 2014, 50:4, 22–42 		12
Проблемы передачи информации Problems of Information Transmission
Total publications: 2404
Scientific articles: 2311
Authors: 1348
Citations: 8232
Cited articles: 1135

Impact-factor Math-Net.Ru
for 2021: 1.574
for 2020: 1.367
for 2019: 0.881
for 2018: 0.613
for 2017: 0.615
for 2016: 0.645
for 2015: 0.912
for 2014: 1.129
for 2013: 0.694
for 2012: 0.526
for 2011: 0.734
for 2010: 0.791
for 2009: 0.613
for 2008: 0.554
for 2007: 0.727
for 2006: 0.538
for 2005: 0.385
for 2004: 0.484
for 2003: 0.338

Impact Factor Web of Science
for 2023: 0.500
for 2022: 1.200
for 2021: 1.340
for 2020: 1.082
for 2019: 0.593
for 2018: 0.557
for 2017: 0.359
for 2016: 0.581
for 2015: 0.632
for 2014: 0.597
for 2013: 0.371
for 2012: 0.298
for 2011: 0.484
for 2010: 0.418
for 2009: 0.393

Scopus Metrics
2023 CiteScore 2.000
2023 SNIP 0.633
2023 SJR 0.451
2022 SJR 0.588
2021 SJR 0.661
2020 SJR 0.525
2019 SJR 0.506
2018 CiteScore 0.440
2018 SJR 0.282
2017 CiteScore 0.460
2017 SNIP 0.980
2017 SJR 0.353
2016 CiteScore 0.680
2016 SNIP 0.906
2016 SJR 0.460
2015 CiteScore 0.680
2015 SNIP 0.853
2015 IPP 0.488
2015 SJR 0.403
2014 CiteScore 0.510
2014 SNIP 0.628
2014 IPP 0.446
2014 SJR 0.287
2013 SNIP 1.536
2013 IPP 0.625
2013 SJR 0.697
2012 SNIP 0.800
2012 IPP 0.337
2012 SJR 0.521

Most published authors
Most cited authors
Most cited articles
Most requested articles
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024