Person:510490: Difference between revisions

From MaRDI portal
Person:510490
Created automatically from import231006081045
 
m AuthorDisambiguator moved page P. G. Boyvalenkov to P. G. Boyvalenkov: Duplicate
 
(No difference)

Latest revision as of 15:20, 9 December 2023

Available identifiers

zbMath Open boyvalenkov.peter-gMaRDI QIDQ510490

List of research outcomes

PublicationDate of PublicationType
The kissing number in 48 dimensions for codes with certain forbidden distances is 52 416 0002023-12-08Paper
On codes with distances \(d\) and \(n\)2023-07-21Paper
On polarization of spherical codes and designs2023-04-05Paper
Bounds for the sum of distances of spherical sets of small size2023-03-10Paper
Universal minima of discrete potentials for sharp spherical codes2022-10-31Paper
Quadruples for Residue Number Systems with Sum of Quotients a Power of a Prime2022-09-19Paper
On polarization of spherical codes and designs2022-07-15Paper
Rationality of the inner products of spherical \(s\)-distance \(t\)-designs for \(t \geq 2s - 2\), \(s \geq 3\)2022-05-03Paper
Linear Programming Bounds2021-11-26Paper
On spherical 4-distance 7-designs2021-10-09Paper
Linear Programming Bounds for Spherical (k,k)-Designs2021-10-04Paper
Universal Bounds for Size and Energy of Codes of Given Minimum and Maximum Distances2021-07-23Paper
Linear programming bounds for covering radius of spherical designs2021-07-07Paper
Bounds for the sum of distances of spherical sets of small size2021-05-07Paper
Bounds for spherical codes: The Levenshtein framework lifted2021-03-29Paper
On two-weight codes2021-03-25Paper
Upper energy bounds for spherical designs of relatively small cardinalities2021-01-29Paper
Upper bounds for energies of spherical codes of given cardinality and separation2020-09-22Paper
On 3-distance spherical 5-designs2020-07-03Paper
On \(q\)-ary codes with two distances \(d\) and \(d+1\)2020-06-23Paper
Binary (k,k)-designs2020-04-08Paper
https://portal.mardi4nfdi.de/entity/Q52198432020-03-12Paper
https://portal.mardi4nfdi.de/entity/Q52198442020-03-12Paper
Refinements of Levenshtein bounds in \(q\)-ary Hamming spaces2019-12-10Paper
Energy bounds for codes in polynomial metric spaces2019-08-13Paper
Universal bounds for spherical codes: the Levenshtein framework lifted2019-06-07Paper
On spherical codes with inner products in a prescribed interval2019-02-20Paper
https://portal.mardi4nfdi.de/entity/Q46399882018-05-15Paper
On maximal antipodal spherical codes with few distances2018-04-13Paper
Universal lower bounds on energy and LP-extremal polynomials for \((4, 24)\)-codes2018-04-13Paper
Universal upper and lower bounds on energy of spherical designs2017-09-07Paper
Nonexistence of a few binary orthogonal arrays2017-03-15Paper
Energy bounds for codes and designs in Hamming spaces2017-02-10Paper
Universal lower bounds for potential energy of spherical codes2016-12-23Paper
Nonexistence of binary orthogonal arrays via their distance distributions2016-10-19Paper
Linear Cryptanalysis and Modified DES with Embedded Parity Check in the S-boxes2016-04-26Paper
A survey on the kissing numbers2015-07-07Paper
Investigation of binary orthogonal arrays via their distance distributions2015-03-17Paper
New nonexistence results for spherical designs2013-07-31Paper
https://portal.mardi4nfdi.de/entity/Q46477772012-11-07Paper
A new asymptotic bound of the minimum possible odd cardinality of spherical \((2k-1)\)-designs2010-07-07Paper
A method for proving nonexistence of spherical designs of odd strength and odd cardinality2009-10-20Paper
Polynomial techniques for investigation of spherical designs2009-03-31Paper
https://portal.mardi4nfdi.de/entity/Q54600402008-05-02Paper
https://portal.mardi4nfdi.de/entity/Q57111732005-12-09Paper
https://portal.mardi4nfdi.de/entity/Q44704572004-07-01Paper
https://portal.mardi4nfdi.de/entity/Q44166832003-08-05Paper
Uniqueness of the 120-point spherical 11-design in four dimensions2002-08-28Paper
https://portal.mardi4nfdi.de/entity/Q27171942001-12-12Paper
https://portal.mardi4nfdi.de/entity/Q45042992000-09-13Paper
https://portal.mardi4nfdi.de/entity/Q45009852000-09-03Paper
https://portal.mardi4nfdi.de/entity/Q42629892000-08-14Paper
Linear programming bounds for codes in infinite projective spaces2000-06-19Paper
https://portal.mardi4nfdi.de/entity/Q49544252000-06-07Paper
Necessary conditions for existence of some designs in polynomial metric spaces2000-01-11Paper
On linear programming bounds for codes in polynomial metric spaces1999-08-16Paper
https://portal.mardi4nfdi.de/entity/Q38386781999-06-27Paper
Nonexistence of certain spherical designs of odd strengths and cardinalities1999-03-30Paper
https://portal.mardi4nfdi.de/entity/Q38387341999-03-04Paper
https://portal.mardi4nfdi.de/entity/Q38386791998-08-13Paper
https://portal.mardi4nfdi.de/entity/Q38386801998-08-13Paper
https://portal.mardi4nfdi.de/entity/Q38387321998-08-13Paper
On lower bounds on the size of designs in compact symmetric spaces of rank 11997-09-24Paper
https://portal.mardi4nfdi.de/entity/Q43527931997-09-04Paper
Upper bounds on the minimum distance of spherical codes1996-10-22Paper
Extremal polynomials for obtaining bounds for spherical codes and designs1996-05-08Paper
Computing distance distributions of spherical designs1996-02-20Paper
https://portal.mardi4nfdi.de/entity/Q48654501996-02-13Paper
https://portal.mardi4nfdi.de/entity/Q48490771996-01-24Paper
On the extremality of the polynomials used for obtaining the best known upper bounds for the kissing numbers1995-03-29Paper
https://portal.mardi4nfdi.de/entity/Q43146541994-12-18Paper
https://portal.mardi4nfdi.de/entity/Q43158031994-12-11Paper
Nonexistence of certain symmetric spherical codes1993-05-16Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: P. G. Boyvalenkov