|
|
Most published authors (scientific articles only) of the journal
|
| 1. |
S. S. Marchenkov |
41 |
| 2. |
A. N. Timashev |
29 |
| 3. |
V. G. Mikhailov |
27 |
| 4. |
Yu. L. Pavlov |
27 |
| 5. |
V. A. Emelichev |
26 |
| 6. |
S. N. Selezneva |
21 |
| 7. |
V. I. Afanasyev |
20 |
| 8. |
G. I. Ivchenko |
19 |
| 9. |
V. P. Chistyakov |
18 |
| 10. |
E. E. Dyakonova |
17 |
| 11. |
O. A. Logachev |
17 |
| 12. |
M. P. Savelov |
17 |
| 13. |
A. M. Zubkov |
17 |
| 14. |
V. A. Vatutin |
16 |
| 15. |
A. V. Chashkin |
16 |
| 16. |
K. A. Popkov |
16 |
| 17. |
A. A. Makhnev |
15 |
| 18. |
A. Tuganbaev |
15 |
| 19. |
È. È. Gasanov |
14 |
| 20. |
A. A. Nechaev |
14 |
| 21. |
B. A. Sevast'yanov |
14 |
| 22. |
B. I. Selivanov |
14 |
| 23. |
M. I. Tikhomirova |
14 |
| 24. |
A. L. Yakymiv |
14 |
|
40 most published authors of the journal |
|
| Most cited authors of the journal |
| 1. |
A. A. Nechaev |
231 |
| 2. |
S. S. Marchenkov |
197 |
| 3. |
V. A. Emelichev |
175 |
| 4. |
V. I. Afanasyev |
138 |
| 5. |
V. G. Mikhailov |
134 |
| 6. |
Yu. L. Pavlov |
120 |
| 7. |
E. E. Dyakonova |
112 |
| 8. |
V. T. Markov |
100 |
| 9. |
O. A. Logachev |
99 |
| 10. |
A. Tuganbaev |
96 |
| 11. |
S. N. Selezneva |
94 |
| 12. |
M. P. Savelov |
89 |
| 13. |
V. V. Yashchenko |
85 |
| 14. |
V. M. Sidel'nikov |
78 |
| 15. |
V. A. Vatutin |
76 |
| 16. |
K. A. Popkov |
75 |
| 17. |
D. S. Romanov |
75 |
| 18. |
A. L. Yakymiv |
72 |
| 19. |
A. A. Makhnev |
71 |
| 20. |
A. V. Kolchin |
69 |
| 21. |
I. V. Chizhov |
69 |
|
40 most cited authors of the journal |
|
| Most cited articles of the journal |
| 1. |
Kerdock's code in cyclic form A. A. Nechaev Diskr. Mat., 1989, 1:4, 123–139 |
83 |
| 2. |
Bent functions from a finite abelian group into a finite abelian group V. I. Solodovnikov Diskr. Mat., 2002, 14:1, 99–113 |
53 |
| 3. |
Uniformly distributed sequences of $p$-adic integers V. S. Anashin Diskr. Mat., 2002, 14:4, 3–64 |
52 |
| 4. |
Effective attack on the McEliece cryptosystem based on Reed–Muller codes M. A. Borodin, I. V. Chizhov Diskr. Mat., 2014, 26:1, 10–20 |
47 |
| 5. |
Approximate algorithms for packing rectangles into several strips S. N. Zhuk Diskr. Mat., 2006, 18:1, 91–105 |
41 |
| 6. |
Properties of bent functions of $q$-valued logic over finite fields A. S. Ambrosimov Diskr. Mat., 1994, 6:3, 50–60 |
39 |
| 7. |
Transitive polynomial transformations of residue class rings M. V. Larin Diskr. Mat., 2002, 14:2, 20–32 |
38 |
| 8. |
On large deviations of branching processes in a random environment: a geometric distribution of the number of descendants M. V. Kozlov Diskr. Mat., 2006, 18:2, 29–47 |
34 |
| 9. |
On the expressibility of functions of many-valued logic in some logical-functional classes S. S. Marchenkov Diskr. Mat., 1999, 11:4, 110–126 |
34 |
| 10. |
Open coding based on Reed–Muller binary codes V. M. Sidel'nikov Diskr. Mat., 1994, 6:2, 3–20 |
34 |
| 11. |
Bent functions on a finite abelian group O. A. Logachev, A. A. Sal'nikov, V. V. Yashchenko Diskr. Mat., 1997, 9:4, 3–20 |
33 |
| 12. |
Synthesis of easily testable circuits over the Zhegalkin basis in the case of constant faults of type 0 at outputs of elements Yu. V. Borodina, P. A. Borodin Diskr. Mat., 2010, 22:3, 127–133 |
32 |
| 13. |
$\Omega$-foliated formations and Fitting classes of finite groups V. A. Vedernikov, M. M. Sorokina Diskr. Mat., 2001, 13:3, 125–144 |
32 |
| 14. |
On the number of independent sets in extenders A. A. Sapozhenko Diskr. Mat., 2001, 13:1, 56–62 |
32 |
| 15. |
Linear recurrent sequences over commutative rings A. A. Nechaev Diskr. Mat., 1991, 3:4, 105–127 |
32 |
| 16. |
On an encoding system constructed on the basis of generalized Reed–Solomon codes V. M. Sidel'nikov, S. O. Shestakov Diskr. Mat., 1992, 4:3, 57–63 |
31 |
| 17. |
Method of synthesis of easily testable circuits admitting single fault detection tests of constant length D. S. Romanov Diskr. Mat., 2014, 26:2, 100–130 |
30 |
| 18. |
On limit theorems for the generalised allocation scheme A. V. Kolchin Diskr. Mat., 2003, 15:4, 148–157 |
30 |
| 19. |
A general approach to studying the stability of a Pareto optimal solution of a vector integer linear programming problem V. A. Emelichev, K. G. Kuz'min Diskr. Mat., 2007, 19:3, 79–83 |
25 |
| 20. |
On the linear complexity of binary sequences on the basis of biquadratic and sextic residue classes V. A. Edemskii Diskr. Mat., 2010, 22:1, 74–82 |
24 |
|
40 most cited articles of the journal |
|
| Total publications: |
1760 |
| Scientific articles: |
1711 |
| Authors: |
949 |
| Citations: |
6170 |
| Cited articles: |
1195 |
 |
Impact Factor Web of Science |
|
for 2025:
0.500 |
|
for 2024:
0.300 |
|
for 2023:
0.300 |
 |
Scopus Metrics |
|
2025 |
CiteScore |
0.800 |
|
2025 |
SNIP |
0.895 |
|
2025 |
SJR |
0.284 |
|
2024 |
CiteScore |
0.700 |
|
2024 |
SNIP |
0.683 |
|
2024 |
SJR |
0.195 |
|
2023 |
CiteScore |
0.600 |
|
2023 |
SNIP |
0.704 |
|
2023 |
SJR |
0.177 |
|
2022 |
SJR |
0.265 |
|
2021 |
SJR |
0.226 |
|
2020 |
SJR |
0.254 |
|
2019 |
SJR |
0.157 |
|
2018 |
CiteScore |
0.440 |
|
2018 |
SJR |
0.325 |
|
2017 |
CiteScore |
0.210 |
|
2017 |
SNIP |
0.548 |
|
2017 |
SJR |
0.204 |
|
2016 |
CiteScore |
0.160 |
|
2016 |
SNIP |
0.557 |
|
2016 |
SJR |
0.245 |
|
2015 |
CiteScore |
0.230 |
|
2015 |
SNIP |
0.507 |
|
2015 |
IPP |
0.227 |
|
2015 |
SJR |
0.278 |
|
2014 |
CiteScore |
0.130 |
|
2014 |
SNIP |
0.664 |
|
2014 |
SJR |
0.204 |
|
2013 |
SNIP |
0.034 |
|
2013 |
IPP |
0.019 |
|
2013 |
SJR |
0.142 |
|
2012 |
SNIP |
0.333 |
|
2012 |
IPP |
0.143 |
|
2012 |
SJR |
0.238 |
|