P. Boyvalenkov

发表

Energy bounds for codes in polynomial metric spaces

E. Saff, D. Hardin, P. Boyvalenkov, 2018, Analysis and Mathematical Physics.

ON LINEAR PROGRAMMING BOUNDS FOR CODES IN POLYNOMIAL METRIC SPACES

P. Boyvalenkov, D. Danev, 1998 .

Universal upper and lower bounds on energy of spherical designs

E. Saff, D. Hardin, P. Boyvalenkov, 2015, 1509.07837.

Universal Lower Bounds for Potential Energy of Spherical Codes

E. Saff, D. Hardin, P. Boyvalenkov, 2015, Constructive Approximation.

On lower bounds on the size of designs in compact symmetric spaces of rank 1

Svetla Nikova, Peter Boyvalenkov, P. Boyvalenkov, 1997 .

Improved approaches for investigation of small spherical designs

P. Boyvalenkov, M. Stoyanova, 2011 .

On the Riesz Energy of Spherical Designs

P. Boyvalenkov, P. Dragnev, 2014 .

Upper bounds for energies of spherical codes of given cardinality and separation

E. Saff, D. Hardin, P. Boyvalenkov, 2019, Designs, Codes and Cryptography.

Quadruples for Residue Number Systems with Sum of Quotients a Power of a Prime

P. Boyvalenkov, Georgi Boyvalenkov, 2021, Serdica Journal of Computing.

LINEAR PROGRAMMING BOUNDS FOR SPHERICAL CODES AND DESIGNS

P. Boyvalenkov, D. Danev, 2007 .

On polarization of spherical codes and designs

E. Saff, D. Hardin, P. Boyvalenkov, 2022, Journal of Mathematical Analysis and Applications.

Linear Programming Bounds for Covering Radius of Spherical Designs

P. Boyvalenkov, Maya M. Stoyanova, 2020, 2007.05599.

Linear Programming Bounds for Spherical (k,k)-Designs

P. Boyvalenkov, 2020, 2004.00659.

New asymptotic bounds for some spherical ( 2 k − 1 )-designs

P. Boyvalenkov, 2009 .

Nonexistence results for spherical 3-designs of small cardinalities

P. Boyvalenkov, S. Nikova, V. Nikov, 1997, Proceedings of IEEE International Symposium on Information Theory.

On the classification of the tight spherical designs

P. Boyvalenkov, 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

Bounds for the sum of distances of spherical sets of small size

A. Barg, P. Boyvalenkov, Maya M. Stoyanova, 2021, Discret. Math..

Universal minima of discrete potentials for sharp spherical codes

E. Saff, D. Hardin, P. Boyvalenkov, 2022, 2211.00092.

On spherical codes with inner products in a prescribed interval

Maya Stoyanova, Peter Boyvalenkov, Edward B. Saff, 2018, Des. Codes Cryptogr..

Rationality of the inner products of spherical $s$-distance $t$-designs for $t \geq 2s-2$, $s \geq 3$

P. Boyvalenkov, Hiroshi Nozaki, Navid Safaei, 2022, 2204.00261.

Linear Programming Bounds pdf

Danyo Danev, Peter Boyvalenkov, P. Boyvalenkov, 2019, ArXiv.

Energy bounds for codes and designs in Hamming spaces

Maya Stoyanova, Peter Boyvalenkov, Edward B. Saff, 2015, Designs, Codes and Cryptography.

Upper bounds on the minimum distance of spherical codes

Danyo Danev, Peter Boyvalenkov, Silvia P. Boumova, 1996, IEEE Trans. Inf. Theory.

Necessary Conditions for Existence of Some Designs in Polynomial Metric Spaces

Danyo Danev, Peter Boyvalenkov, Silvia P. Boumova, 1999, Eur. J. Comb..

Nonexistence of a few binary orthogonal arrays pdf

Maya Stoyanova, Peter Boyvalenkov, Tanya Marinova, 2016, Discret. Appl. Math..

A survey on the kissing numbers

S. Dodunekov, O. Musin, P. Boyvalenkov, 2015, 1507.03631.

Refinements of Levenshtein Bounds in q-ary Hamming Spaces

Maya Stoyanova, Danyo Danev, Peter Boyvalenkov, 2018, Probl. Inf. Transm..

Bounds for spherical codes: The Levenshtein framework lifted

E. Saff, D. Hardin, P. Boyvalenkov, 2019, Math. Comput..

On two-weight codes

V. Zinoviev, D. Zinoviev, P. Boyvalenkov, 2020, Discret. Math..

On q-ary Codes with Two Distances d and d + 1

D. Zinoviev, P. Boyvalenkov, K. Delchev, 2019, Problems of Information Transmission.

On maximal antipodal spherical codes with few distances

Peter Boyvalenkov, Konstantin Delchev, P. Boyvalenkov, 2017, Electron. Notes Discret. Math..

On two-weight (linear and nonlinear) codes

V. Zinoviev, D. Zinoviev, P. Boyvalenkov, 2020, 2020 Algebraic and Combinatorial Coding Theory (ACCT).

Universal Bounds for Size and Energy of Codes of Given Minimum and Maximum Distances pdf

Peter Boyvalenkov, Peter Dragnev, Edward Saff, 2019, IEEE Transactions on Information Theory.

On maximal Spherical codes II

Danyo Danev, Peter Boyvalenkov, Ivan N. Landgev, 1999 .

Linear Programming Bounds for Cardinality and Energy of Codes of Given Min and Max Distances

Peter Boyvalenkov, Peter Dragnev, Edward Saff, 2019, 2019 IEEE International Symposium on Information Theory (ISIT).