V.M. Sidelnikov

463 total citations
15 papers, 221 citations indexed

About

V.M. Sidelnikov is a scholar working on Artificial Intelligence, Electrical and Electronic Engineering and Discrete Mathematics and Combinatorics. According to data from OpenAlex, V.M. Sidelnikov has authored 15 papers receiving a total of 221 indexed citations (citations by other indexed papers that have themselves been cited), including 9 papers in Artificial Intelligence, 5 papers in Electrical and Electronic Engineering and 4 papers in Discrete Mathematics and Combinatorics. Recurrent topics in V.M. Sidelnikov's work include Coding theory and cryptography (8 papers), graph theory and CDMA systems (5 papers) and Mathematical Approximation and Integration (4 papers). V.M. Sidelnikov is often cited by papers focused on Coding theory and cryptography (8 papers), graph theory and CDMA systems (5 papers) and Mathematical Approximation and Integration (4 papers). V.M. Sidelnikov collaborates with scholars based in Russia and Tajikistan. V.M. Sidelnikov's co-authors include Vladimir S. Mironov and Л. С. Казарин and has published in prestigious journals such as Designs Codes and Cryptography, Journal of Algebraic Combinatorics and Cybernetics and Systems Analysis.

In The Last Decade

V.M. Sidelnikov

14 papers receiving 186 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
V.M. Sidelnikov Russia 7 185 101 54 42 28 15 221
M. Rem Netherlands 9 69 0.4× 122 1.2× 74 1.4× 11 0.3× 102 3.6× 42 258
Kyoki Imamura Japan 8 201 1.1× 132 1.3× 36 0.7× 40 1.0× 77 2.8× 22 224
Othmar Staffelbach Germany 3 258 1.4× 106 1.0× 56 1.0× 115 2.7× 46 1.6× 3 285
Nikolay A. Moldovyan Russia 10 211 1.1× 86 0.9× 54 1.0× 67 1.6× 29 1.0× 78 286
Siwei Sun China 10 227 1.2× 97 1.0× 13 0.2× 87 2.1× 25 0.9× 37 267
Juriaan Simonis Netherlands 11 309 1.7× 263 2.6× 139 2.6× 11 0.3× 97 3.5× 34 380
Michael J. Ganley United Kingdom 11 194 1.0× 177 1.8× 18 0.3× 41 1.0× 30 1.1× 24 286
Netanel Raviv United States 11 260 1.4× 67 0.7× 212 3.9× 23 0.5× 82 2.9× 51 388
G. Yuval Israel 8 73 0.4× 61 0.6× 100 1.9× 53 1.3× 69 2.5× 17 217
Shengyu Zhang China 7 65 0.4× 50 0.5× 64 1.2× 45 1.1× 17 0.6× 26 179

Countries citing papers authored by V.M. Sidelnikov

Since Specialization
Citations

This map shows the geographic impact of V.M. Sidelnikov's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by V.M. Sidelnikov with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites V.M. Sidelnikov more than expected).

Fields of papers citing papers by V.M. Sidelnikov

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by V.M. Sidelnikov. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by V.M. Sidelnikov. The network helps show where V.M. Sidelnikov may publish in the future.

Co-authorship network of co-authors of V.M. Sidelnikov

This figure shows the co-authorship network connecting the top 25 collaborators of V.M. Sidelnikov. A scholar is included among the top collaborators of V.M. Sidelnikov based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with V.M. Sidelnikov. V.M. Sidelnikov is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

15 of 15 papers shown
1.
Sidelnikov, V.M., et al.. (2009). On the construction of (w, r) cover-free codes. Problems of Information Transmission. 45(1). 32–36. 1 indexed citations
2.
Казарин, Л. С. & V.M. Sidelnikov. (2006). On the automorphism group of a Suzuki p-algebra. Mathematical Notes. 80(3-4). 500–508. 1 indexed citations
3.
Казарин, Л. С., et al.. (2005). Matrix Groups Related to the Quaternion Group and Spherical Orbit Codes. Designs Codes and Cryptography. 37(3). 391–404. 2 indexed citations
4.
5.
Sidelnikov, V.M.. (2002). Quantum Codes and Abelian Subgroups of the Extra-Special Group. Problems of Information Transmission. 38(3). 194–202.
6.
Sidelnikov, V.M.. (2002). On a finite group of matrices generating orbit codes on Euclidean sphere. 436–436. 3 indexed citations
7.
Sidelnikov, V.M.. (2002). Orbital spherical 11-designs whose initial point is root of an invariant polynomial. 33. 164–164. 3 indexed citations
8.
Sidelnikov, V.M.. (1999). Spherical 7-Designs in 2 n -Dimensional Euclidean Space. Journal of Algebraic Combinatorics. 10(3). 279–288. 11 indexed citations
9.
Sidelnikov, V.M.. (1994). A public-key cryptosystem based on binary Reed-Muller codes. Discrete Mathematics and Applications. 4(3). 53 indexed citations
10.
Sidelnikov, V.M.. (1992). Estimates for the number of appearances of symbols on a segment of recurrent sequence over a finite field. Discrete Mathematics and Applications. 2(5). 6 indexed citations
11.
Sidelnikov, V.M., et al.. (1992). On insecurity of cryptosystems based on generalized Reed-Solomon codes. Discrete Mathematics and Applications. 2(4). 106 indexed citations
12.
Sidelnikov, V.M.. (1988). ON NORMAL BASES OF A FINITE FIELD. Mathematics of the USSR-Sbornik. 61(2). 485–494. 8 indexed citations
13.
Sidelnikov, V.M.. (1975). Upper bounds on the cardinality of a binary code with a given minimum distance. Information and Control. 28(4). 292–303. 6 indexed citations
14.
Sidelnikov, V.M.. (1974). NEW BOUNDS FOR DENSEST PACKING OF SPHERES INn-DIMENSIONAL EUCLIDEAN SPACE. Mathematics of the USSR-Sbornik. 24(1). 147–157. 14 indexed citations
15.
Sidelnikov, V.M.. (1965). On the statistical properties of transformations realizabie on finite automata. Cybernetics and Systems Analysis. 1(6). 1–19. 2 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by M. Rem Breakdown of academic impact, for papers by Kyoki Imamura Breakdown of academic impact, for papers by Othmar Staffelbach Breakdown of academic impact, for papers by Nikolay A. Moldovyan Breakdown of academic impact, for papers by Siwei Sun Breakdown of academic impact, for papers by Juriaan Simonis Breakdown of academic impact, for papers by Michael J. Ganley Breakdown of academic impact, for papers by Netanel Raviv Breakdown of academic impact, for papers by G. Yuval Breakdown of academic impact, for papers by Shengyu Zhang
Rankless by CCL
2026