New lower bounds for some spherical designs. - Peter G. Boyvalenkov; Svetla Nikova (Algebraic Coding, 1993)

Nonexistence of Certain Symmetrical Spherical Codes. - Peter G. Boyvalenkov (Des. Codes Cryptogr., 1993)

On Maximal Spherical Codes I. - Peter G. Boyvalenkov; Ivan N. Landgev (AAECC, 1995)

Extremal Polynomials for Obtaining Bounds for Spherical Codes and Designs. - Peter G. Boyvalenkov (Discret. Comput. Geom., 1995)

Upper bounds on the minimum distance of spherical codes. - Peter G. Boyvalenkov; Danyo Danev; Silvia P. Boumova (IEEE Trans. Inf. Theory, 1996)

On Maximal Codes in Polynominal Metric Spaces. - Peter G. Boyvalenkov; Danyo Danev (AAECC, 1997)

Indexes of spherical codes. - Peter G. Boyvalenkov; Danyo Danev; Peter Kazakov (Codes and Association Schemes, 1999)

Nonexistence of Certain Spherical Designs of Odd Strengths and Cardinalities. - Peter G. Boyvalenkov; Danyo Danev; Svetla Nikova (Discret. Comput. Geom., 1999)

Necessary Conditions for Existence of Some Designs in Polynomial Metric Spaces. - Peter G. Boyvalenkov; Silvia P. Boumova; Danyo Danev (Eur. J. Comb., 1999)

Polynomial techniques for investigation of spherical designs. - Silvia P. Boumova; Peter G. Boyvalenkov; Hristina N. Kulina; Maya Stoyanova (Des. Codes Cryptogr., 2009)

A method for proving nonexistence of spherical designs of odd strength and odd cardinality. - Silvia P. Boumova; Peter G. Boyvalenkov; Maya Stoyanova (Probl. Inf. Transm., 2009)

A new asymptotic bound of the minimum possible odd cardinality of spherical (2k-1)-designs. - Peter G. Boyvalenkov; Maya Stoyanova (Discret. Math., 2010)

New nonexistence results for spherical designs. - Peter G. Boyvalenkov; Maya Stoyanova (Adv. Math. Commun., 2013)

Investigation of binary orthogonal arrays via their distance distributions. - Peter G. Boyvalenkov; Hristina N. Kulina (Probl. Inf. Transm., 2013)

Linear Cryptanalysis and Modified DES with Embedded Parity Check in the S-boxes. - Yuri L. Borissov; Peter G. Boyvalenkov; Robert Tsenkov (BalkanCryptSec, 2015)

Nonexistence of binary orthogonal arrays via their distance distributions. - Peter G. Boyvalenkov; Hristina N. Kulina; Tanya Marinova; Maya Stoyanova (Probl. Inf. Transm., 2015)

Nonexistence of a few binary orthogonal arrays. - Peter G. Boyvalenkov; Tanya Marinova; Maya Stoyanova (Discret. Appl. Math., 2017)

Energy bounds for codes and designs in Hamming spaces. - Peter G. Boyvalenkov; Peter D. Dragnev; Douglas P. Hardin; Edward B. Saff; Maya Stoyanova (Des. Codes Cryptogr., 2017)

On maximal antipodal spherical codes with few distances. - Peter G. Boyvalenkov; Konstantin Delchev (Electron. Notes Discret. Math., 2017)

Universal Lower Bounds on Energy and LP-Extremal Polynomials for (4, 24)-Codes. - Peter G. Boyvalenkov; Peter D. Dragnev; Douglas P. Hardin; Edward B. Saff; Maya Stoyanova (Electron. Notes Discret. Math., 2017)

On a Linear Cryptanalysis of a Family of Modified DES Ciphers with Even Weight S-boxes. - Yuri L. Borissov; Peter G. Boyvalenkov; Robert Tsenkov (IACR Cryptol. ePrint Arch., 2017)

Optimisation Techniques in Wildfire Simulations. Test Case Kresna Fire August 2017. - Nina Dobrinkova; Momchil Panayotov; Peter G. Boyvalenkov (NMA, 2018)

Refinements of Levenshtein bounds in q-ary Hamming spaces. - Peter G. Boyvalenkov; Danyo Danev; Maya Stoyanova (CoRR, 2018)

Refinements of Levenshtein Bounds in q-ary Hamming Spaces. - Peter G. Boyvalenkov; Danyo Danev; Maya Stoyanova (Probl. Inf. Transm., 2018)

Linear Programming Bounds for Cardinality and Energy of Codes of Given Min and Max Distances. - Peter G. Boyvalenkov; Peter Dragnev; Douglas P. Hardin; Edward B. Saff; Maya Stoyanova (ISIT, 2019)

On Two Problems Concerning Universal Bounds for Codes. - Peter G. Boyvalenkov; Peter Dragnev; Douglas P. Hardin; Edward B. Saff; Maya Stoyanova (REDUNDANCY, 2019)

Linear Programming Bounds. - Peter G. Boyvalenkov; Danyo Danev (CoRR, 2019)

On q-ary codes with two distances d and d+1. - Peter G. Boyvalenkov; Konstantin Delchev; Dmitrii V. Zinoviev; Victor A. Zinoviev (CoRR, 2019)

On spherical codes with inner products in a prescribed interval. - Peter G. Boyvalenkov; Peter D. Dragnev; Douglas P. Hardin; Edward B. Saff; Maya Stoyanova (Des. Codes Cryptogr., 2019)

New lower and upper bounds on Armstrong codes. - Todorka Alexandrova; Peter G. Boyvalenkov; Attila Sali (ACCT, 2020)

On two-weight (linear and nonlinear) codes. - Peter G. Boyvalenkov; Konstantin Delchev; Dmitrii V. Zinoviev; Victor A. Zinoviev (ACCT, 2020)

Classification of Moduli Sets for Residue Number System With Special Diagonal Functions. - Peter G. Boyvalenkov; Nikolay I. Chervyakov; Pavel Alekseevich Lyakhov; Nataliya Semyonova; Anton S. Nazarov; Maria V. Valueva; Georgi Boyvalenkov; Danil Bogaevskiy; Dmitry I. Kaplun (IEEE Access, 2020)

Upper bounds for energies of spherical codes of given cardinality and separation. - Peter G. Boyvalenkov; Peter D. Dragnev; Douglas P. Hardin; Edward B. Saff; Maya Stoyanova (Des. Codes Cryptogr., 2020)

On q-ary Codes with Two Distances d and d + 1. - Peter G. Boyvalenkov; Konstantin Delchev; Dmitrii V. Zinoviev; Victor A. Zinoviev (Probl. Inf. Transm., 2020)

On spherical 4-distance 7-designs. - Peter G. Boyvalenkov; Navid Safaei (REDUNDANCY, 2021)

Upper Energy Bounds for Spherical Designs of Relatively Small Cardinalities. - Peter G. Boyvalenkov; Konstantin Delchev; Matthieu Jourdain (Discret. Comput. Geom., 2021)

On two-weight codes. - Peter G. Boyvalenkov; Konstantin Delchev; Dmitrii V. Zinoviev; Victor A. Zinoviev (Discret. Math., 2021)

Bounds for spherical codes: The Levenshtein framework lifted. - Peter G. Boyvalenkov; Peter D. Dragnev; Douglas P. Hardin; Edward B. Saff; Maya Stoyanova (Math. Comput., 2021)

Universal Bounds for Size and Energy of Codes of Given Minimum and Maximum Distances. - Peter G. Boyvalenkov; Peter D. Dragnev; Douglas P. Hardin; Edward B. Saff; Maya Stoyanova (IEEE Trans. Inf. Theory, 2021)

Bounds for the Minimum Distance and Covering Radius of Orthogonal Arrays Via Their Distance Distributions. - Silvia P. Boumova; Peter G. Boyvalenkov; Maya Stoyanova (IWSDA, 2022)

On Codes with Distances d and n. - Peter G. Boyvalenkov; Konstantin Delchev; Victor A. Zinoviev; Dmitrii V. Zinoviev (Probl. Inf. Transm., 2022)

Bounds for the sum of distances of spherical sets of small size. - Alexander Barg; Peter G. Boyvalenkov; Maya Stoyanova (Discret. Math., 2023)

Residue number systems with six modules and efficient circuits based on power-of-two diagonal modulus. - Peter G. Boyvalenkov; Pavel A. Lyakhov; Nataliya Semyonova; Maria V. Valueva; Georgi Boyvalenkov; Dmitrii V. Minenkov; Dmitrii I. Kaplun (Comput. Electr. Eng., 2023)

Universal optimality of T-avoiding spherical codes and designs. - Peter G. Boyvalenkov; Danila D. Cherkashin; Peter D. Dragnev (CoRR, 2025)

On irredundant orthogonal arrays. - Maryam Bajalan; Peter G. Boyvalenkov (CoRR, 2025)