Семинарът 

Problems and Methods Related to Coding Theory

Организиран от

ИМИ – БАН, Секция “Математически основи на информатиката”,

 Novosibirsk State University, Novosibirsk, Russia, и

 Sobolev Institute of Mathematics, Siberian Branch of  the Russian Academy of Sciences, Novosibirsk, Russia

Ви кани на поредната си сбирка, която ще се проведе онлайн на 02 март 2021 г. от 13:00 часа.

Петър Бойваленков, ИМИ-БАН,

ще изнесе доклад на тема:

Universal Bounds for Cardinality 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.

Joint work with Peter Dragnev, Douglas Hardin, Edward Saff, Maya Stoyanova

Страница на семинара: http://www.math.bas.bg/moiuser/PMCT/

ТеТ
Join Zoom Meeting

Zoom ID: 910 5863 2644

Password: 12624120

https://zoom.us/j/91058632644?pwd=Q3FZa29SV0pTUTZ5bEl1WGwyQU8xUT09