Maya Stoyanova

Prof. Maya Stoyanova

orcid

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 February 2016 in Constructive Approximation
Verified
Journal Article
Closed access
PDF file
PBPeter Boyvalenkov
Peter Boyvalenkov
PDP. D. Dragnev
P. D. Dragnev
DHD. P. Hardin
D. P. Hardin
ESE. B. Saff
E. B. Saff
MSMaya Stoyanova
Maya Stoyanova

1 January 2017 in Discrete Applied Mathematics
Verified
Journal Article
Closed access
PBPeter Boyvalenkov
Peter Boyvalenkov
TMTanya Marinova
Tanya Marinova
MSMaya Stoyanova
Maya Stoyanova

6 June 2019 in Analysis and Mathematical Physics
Verified
Journal Article
Closed access
PDF file
PBPeter Boyvalenkov
Peter Boyvalenkov
PDP. D. Dragnev
P. D. Dragnev
DHD. P. Hardin
D. P. Hardin
ESE. B. Saff
E. B. Saff
MSMaya Stoyanova
Maya Stoyanova

26 July 2018 in Designs, Codes and Cryptography
Verified
Journal Article
Closed access
PDF file
PBPeter Boyvalenkov
Peter Boyvalenkov
PDP. D. Dragnev
P. D. Dragnev
DHD. P. Hardin
D. P. Hardin
ESE. B. Saff
E. B. Saff
MSMaya Stoyanova
Maya Stoyanova

2 February 2021 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
PBPeter Boyvalenkov
Peter Boyvalenkov
PDPeter D. Dragnev
Peter D. Dragnev
DHDouglas P. Hardin
Douglas P. Hardin
ESEdward B. Saff
Edward B. Saff
MSMaya Stoyanova
Maya Stoyanova
We employ signed measures that are positive definite up to certain degrees to establish Levenshtein-type upper bounds on the cardinality of codes with given minimum and maximum distances, and universal lower bounds on the potential energy (for absolutely monotone interactions) for codes with given maximum distance and cardinality. The distance distributions of codes that attain the bounds are found in terms of the parameters of Levenshtein-type quadrature formulas. Necessary and sufficient conditions for the optimality of our bounds are derived. Further, we obtain upper bounds on the energy of codes of fixed minimum and maximum distances and cardinality.

14 October 2016 in Designs, Codes and Cryptography
Verified
Journal Article
Closed access
PDF file
PBPeter Boyvalenkov
Peter Boyvalenkov
PDP. D. Dragnev
P. D. Dragnev
DHD. P. Hardin
D. P. Hardin
ESE. B. Saff
E. B. Saff
MSMaya Stoyanova
Maya Stoyanova