Peter Boyvalenkov

458 total citations
44 papers, 197 citations indexed

About

Peter Boyvalenkov is a scholar working on Numerical Analysis, Artificial Intelligence and Electrical and Electronic Engineering. According to data from OpenAlex, Peter Boyvalenkov has authored 44 papers receiving a total of 197 indexed citations (citations by other indexed papers that have themselves been cited), including 31 papers in Numerical Analysis, 24 papers in Artificial Intelligence and 14 papers in Electrical and Electronic Engineering. Recurrent topics in Peter Boyvalenkov's work include Mathematical Approximation and Integration (31 papers), Coding theory and cryptography (23 papers) and graph theory and CDMA systems (14 papers). Peter Boyvalenkov is often cited by papers focused on Mathematical Approximation and Integration (31 papers), Coding theory and cryptography (23 papers) and graph theory and CDMA systems (14 papers). Peter Boyvalenkov collaborates with scholars based in Bulgaria, United States and Russia. Peter Boyvalenkov's co-authors include Danyo Danev, Douglas P. Hardin, Peter D Dragnev, Edward B. Saff, Svetla Nikova⋆, Victor Zinoviev, Dmitrii Kaplun, E. B. Saff, Pavel Lyakhov and Maria Valueva and has published in prestigious journals such as IEEE Transactions on Information Theory, IEEE Access and Mathematics of Computation.

In The Last Decade

Peter Boyvalenkov

35 papers receiving 179 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Peter Boyvalenkov Bulgaria	9	144	91	62	44	27	44	197
Hajime Tanaka Japan	10	34 0.2×	140 1.5×	106 1.7×	11 0.3×	7 0.3×	33	299
Boris Venkov Russia	10	59 0.4×	88 1.0×	50 0.8×	22 0.5×	3 0.1×	29	236
Alexander Vladimirov Russia	11	46 0.3×	13 0.1×	16 0.3×	8 0.2×	10 0.4×	26	266
Attila Sali Hungary	9	18 0.1×	102 1.1×	104 1.7×	6 0.1×	4 0.1×	47	238
Ferenc Szöllősi Hungary	8	23 0.2×	78 0.9×	96 1.5×	2 0.0×	2 0.1×	17	191
Hiroshi Suzuki Japan	11	14 0.1×	172 1.9×	177 2.9×	3 0.1×	7 0.3×	44	364
E. D. Gluskin Israel	7	78 0.5×	15 0.2×	10 0.2×	3 0.1×	7 0.3×	16	259
Dion Gijswijt Netherlands	9	24 0.2×	86 0.9×	68 1.1×	3 0.1×	2 0.1×	22	268
J. E. Reeve United Kingdom	5	13 0.1×	23 0.3×	60 1.0×	10 0.2×	6 0.2×	10	330
V.M. Sidelnikov Russia	7	19 0.1×	185 2.0×	101 1.6×	13 0.3×		15	221

Countries citing papers authored by Peter Boyvalenkov

Since Specialization

Citations

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

Fields of papers citing papers by Peter Boyvalenkov

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Peter Boyvalenkov. 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 Peter Boyvalenkov. The network helps show where Peter Boyvalenkov may publish in the future.

Co-authorship network of co-authors of Peter Boyvalenkov

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

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Boyvalenkov, Peter, et al.. (2025). Energy bounds for weighted spherical codes and designs via linear programming. Analysis and Mathematical Physics. 15(1).

Boyvalenkov, Peter, et al.. (2024). Universal minima of discrete potentials for sharp spherical codes. Revista Matemática Iberoamericana. 41(2). 603–650.

Boyvalenkov, Peter, et al.. (2024). The Kissing Number in 48 Dimensions for Codes with Certain Forbidden Distances is 52 416 000. Results in Mathematics. 80(1).

Barg, Alexander, et al.. (2023). Bounds for the sum of distances of spherical sets of small size. Discrete Mathematics. 346(5). 113346–113346. 1 indexed citations

Boyvalenkov, Peter, et al.. (2023). On polarization of spherical codes and designs. Journal of Mathematical Analysis and Applications. 524(1). 127065–127065. 3 indexed citations

Boyvalenkov, Peter, et al.. (2023). Residue number systems with six modules and efficient circuits based on power-of-two diagonal modulus. Computers & Electrical Engineering. 110. 108854–108854.

Boyvalenkov, Peter, et al.. (2021). Universal Bounds for Size and Energy of Codes of Given Minimum and Maximum Distances. IEEE Transactions on Information Theory. 67(6). 3569–3584. 1 indexed citations

Boyvalenkov, Peter, et al.. (2021). Bounds for spherical codes: The Levenshtein framework lifted. Mathematics of Computation. 90(329). 1323–1356. 3 indexed citations

Boyvalenkov, Peter, et al.. (2016). Energy bounds for codes and designs in Hamming spaces. Designs Codes and Cryptography. 82(1-2). 411–433. 8 indexed citations

10.

Boyvalenkov, Peter, et al.. (2016). On a Linear Cryptanalysis of a Family of Modified DES Ciphers with Even Weight S-Boxes. Cybernetics and Information Technologies. 16(4). 3–12. 2 indexed citations

11.

Boyvalenkov, Peter, et al.. (2016). Nonexistence of a few binary orthogonal arrays. Discrete Applied Mathematics. 217. 144–150. 11 indexed citations

12.

Boyvalenkov, Peter, et al.. (2015). Universal upper and lower bounds on energy of spherical designs. 8. 4 indexed citations

13.

Boyvalenkov, Peter, et al.. (2010). A new asymptotic bound of the minimum possible odd cardinality of spherical (2k−1)-designs. Discrete Mathematics. 310(15-16). 2170–2175. 1 indexed citations

14.

Boyvalenkov, Peter, et al.. (2008). Polynomial techniques for investigation of spherical designs. Designs Codes and Cryptography. 51(3). 275–288. 5 indexed citations

15.

Boyvalenkov, Peter. (2002). On the classification of the tight spherical designs. 40. 105–105.

16.

Boyvalenkov, Peter & Danyo Danev. (2001). Uniqueness of the 120-point spherical 11-design in four dimensions. Archiv der Mathematik. 77(4). 360–368. 6 indexed citations

17.

Boyvalenkov, Peter, et al.. (1999). Necessary Conditions for Existence of Some Designs in Polynomial Metric Spaces. European Journal of Combinatorics. 20(3). 213–225. 13 indexed citations

18.

Boyvalenkov, Peter, et al.. (1999). On maximal Spherical codes II. Journal of Combinatorial Designs. 7(5). 316–326. 8 indexed citations

19.

Boyvalenkov, Peter, et al.. (1995). NEW UPPER BOUNDS FOR SOME SPHERICAL CODES. Bulgarian Digital Mathematics Library (BulDML) at IMI-BAS (Institute of Mathematics and Informatics). 21(3). 231–238. 1 indexed citations

20.

Boyvalenkov, Peter. (1995). Computing distance distributions of spherical designs. Linear Algebra and its Applications. 226-228. 277–286. 9 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