F. I. Solov’eva

545 total citations
50 papers, 222 citations indexed

About

F. I. Solov’eva is a scholar working on Artificial Intelligence, Electrical and Electronic Engineering and Discrete Mathematics and Combinatorics. According to data from OpenAlex, F. I. Solov’eva has authored 50 papers receiving a total of 222 indexed citations (citations by other indexed papers that have themselves been cited), including 47 papers in Artificial Intelligence, 44 papers in Electrical and Electronic Engineering and 18 papers in Discrete Mathematics and Combinatorics. Recurrent topics in F. I. Solov’eva's work include Coding theory and cryptography (47 papers), graph theory and CDMA systems (43 papers) and Finite Group Theory Research (18 papers). F. I. Solov’eva is often cited by papers focused on Coding theory and cryptography (47 papers), graph theory and CDMA systems (43 papers) and Finite Group Theory Research (18 papers). F. I. Solov’eva collaborates with scholars based in Russia, Spain and Sweden. F. I. Solov’eva's co-authors include S. V. Avgustinovich, Olof Heden, Josep Rifà, Joaquim Borges, Mercè Villanueva, Werner Heise, Jaume Pujol, Antoine Lobstein, Thomas Honold and Patric R. J. Östergård and has published in prestigious journals such as IEEE Transactions on Information Theory, Discrete Applied Mathematics and Discrete Mathematics.

In The Last Decade

F. I. Solov’eva

42 papers receiving 214 citations

Peers

F. I. Solov’eva
Kwankyu Lee South Korea
Buket Özkaya Türkiye
Olof Heden Sweden
S. V. Avgustinovich Russia
Shixin Zhu China
Suat Karadeniz Türkiye
Denis S. Krotov Russia
Stefka Bouyuklieva Bulgaria
Willi Geiselmann Germany
Hualu Liu China
Kwankyu Lee South Korea
F. I. Solov’eva
Citations per year, relative to F. I. Solov’eva F. I. Solov’eva (= 1×) peers Kwankyu Lee

Countries citing papers authored by F. I. Solov’eva

Since Specialization
Citations

This map shows the geographic impact of F. I. Solov’eva'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 F. I. Solov’eva with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites F. I. Solov’eva more than expected).

Fields of papers citing papers by F. I. Solov’eva

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by F. I. Solov’eva. 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 F. I. Solov’eva. The network helps show where F. I. Solov’eva may publish in the future.

Co-authorship network of co-authors of F. I. Solov’eva

This figure shows the co-authorship network connecting the top 25 collaborators of F. I. Solov’eva. A scholar is included among the top collaborators of F. I. Solov’eva 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 F. I. Solov’eva. F. I. Solov’eva is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Solov’eva, F. I.. (2022). Partitions into Perfect Codes in the Hamming and Lee Metrics. Problems of Information Transmission. 58(3). 254–264.
2.
Solov’eva, F. I., et al.. (2020). On existence of perfect bitrades in Hamming graphs. Discrete Mathematics. 343(12). 112128–112128.
3.
Solov’eva, F. I., et al.. (2019). On components of the Kerdock codes and the dual of the BCH code C1,3. Discrete Mathematics. 343(2). 111668–111668. 1 indexed citations
4.
Solov’eva, F. I., et al.. (2019). A concatenation construction for propelinear perfect codes from regular subgroups of $\mathrm {GA}(r,2)$. Sibirskie Elektronnye Matematicheskie Izvestiya. 16. 1689–1702. 1 indexed citations
5.
Solov’eva, F. I., et al.. (2018). On explicit minimum weight bases for extended cyclic codes related to Gold functions. Designs Codes and Cryptography. 86(11). 2619–2627. 2 indexed citations
6.
Solov’eva, F. I., et al.. (2016). On the symmetry group of the Mollard code. Problems of Information Transmission. 52(3). 265–275.
7.
Solov’eva, F. I., et al.. (2014). Transitive nonpropelinear perfect codes. Discrete Mathematics. 338(3). 174–182. 3 indexed citations
8.
Rifà, Josep, F. I. Solov’eva, & Mercè Villanueva. (2014). Self-embeddings of Hamming Steiner triple systems of small order and APN permutations. Designs Codes and Cryptography. 75(3). 405–427.
9.
Borges, Joaquim, et al.. (2013). On the Number of Nonequivalent Propelinear Extended Perfect Codes. The Electronic Journal of Combinatorics. 20(2). 7 indexed citations
10.
Solov’eva, F. I., et al.. (2013). On the steiner triple systems of small rank embedded into perfect binary codes. Journal of Applied and Industrial Mathematics. 7(3). 380–395. 1 indexed citations
11.
Solov’eva, F. I., et al.. (2011). On construction of vertex-transitive partitions of the n-cube into perfect codes. Journal of Applied and Industrial Mathematics. 5(2). 301–311. 1 indexed citations
12.
Rifà, Josep, F. I. Solov’eva, & Mercè Villanueva. (2011). Intersection of Hamming codes avoiding Hamming subcodes. Designs Codes and Cryptography. 62(2). 209–223. 1 indexed citations
13.
Solov’eva, F. I.. (2007). On ℤ4-linear codes with the parameters of Reed-Muller codes. Problems of Information Transmission. 43(1). 26–32. 5 indexed citations
14.
Avgustinovich, S. V., F. I. Solov’eva, & Olof Heden. (2005). On the Structure of Symmetry Groups of Vasil’ev Codes. Problems of Information Transmission. 41(2). 105–112. 11 indexed citations
15.
Solov’eva, F. I.. (2005). On perfect binary codes. Electronic Notes in Discrete Mathematics. 21. 371–372.
16.
Solov’eva, F. I.. (2005). On the Construction of Transitive Codes. Problems of Information Transmission. 41(3). 204–211. 12 indexed citations
17.
Avgustinovich, S. V. & F. I. Solov’eva. (2002). Perfect binary codes with trivial automorphism group. 114–115. 9 indexed citations
18.
Avgustinovich, S. V., Antoine Lobstein, & F. I. Solov’eva. (2001). Intersection matrices for partitions by binary perfect codes. IEEE Transactions on Information Theory. 47(4). 1621–1624. 9 indexed citations
19.
Avgustinovich, S. V. & F. I. Solov’eva. (2001). On the metrical rigidity of binary codes. Electronic Notes in Discrete Mathematics. 6. 444–451. 3 indexed citations
20.
Solov’eva, F. I.. (2000). Perfect binary codes: bounds and properties. Discrete Mathematics. 213(1-3). 283–290. 6 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 Kwankyu Lee Breakdown of academic impact, for papers by Buket Özkaya Breakdown of academic impact, for papers by Olof Heden Breakdown of academic impact, for papers by S. V. Avgustinovich Breakdown of academic impact, for papers by Shixin Zhu Breakdown of academic impact, for papers by Suat Karadeniz Breakdown of academic impact, for papers by Denis S. Krotov Breakdown of academic impact, for papers by Stefka Bouyuklieva Breakdown of academic impact, for papers by Willi Geiselmann Breakdown of academic impact, for papers by Hualu Liu
Rankless by CCL
2026