Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Maya Stoyanova

dblp:92/4691 · DBLP profile ↗
← Back
8ranked-venue papers
0as first author
2since 2021 · last 2025
0000-0002-8813-3398ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 5 · 1 since 2021Theory of computation · 2 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Coding theory · 100%

Topics — the 1 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
coding bounds
0.512021
Universal Bounds for Size and Energy of Codes of Given Minimum and Maximum Distances · IEEE Trans. Inf. Theory 2021

Methods — techniques the papers use, named apart from their topics

signed measures · 0.5quadrature formulas · 0.5positive definite measures · 0.5
YearPublicationVenuePosition
2025 Bounds on discrete potentials of spherical (k, k)-designs
Sergiy V. Borodachov, Peter G. Boyvalenkov, Peter D. Dragnev, Douglas P. Hardin, Edward B. Saff, Maya Stoyanova
Des. Codes Cryptogr.6
2021 Universal Bounds for Size and Energy of Codes of Given Minimum and Maximum Distances
abstract
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.
Peter G. Boyvalenkov, Peter D. Dragnev, Douglas P. Hardin, Edward B. Saff, Maya Stoyanova
IEEE Trans. Inf. Theory5
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.5
2019 Linear Programming Bounds for Cardinality and Energy of Codes of Given Min and Max Distances
abstract
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 distance, and universal lower bounds on the potential energy (for absolutely monotone interactions) for codes with given maximum distance and fixed cardinality. In particular, we extend the framework of Levenshtein bounds for such codes.
Peter G. Boyvalenkov, Peter D. Dragnev, Douglas P. Hardin, Edward B. Saff, Maya Stoyanova
ISIT5
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.5
2017 Nonexistence of a few binary orthogonal arrays
Peter G. Boyvalenkov, Tanya Marinova, Maya Stoyanova
Discret. Appl. Math.3
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.5
2009 Polynomial techniques for investigation of spherical designs
Silvia P. Boumova, Peter G. Boyvalenkov, Hristina N. Kulina, Maya Stoyanova
Des. Codes Cryptogr.4