Seminar on Problems and Methods Related to Coding Theory

The seminar on Problems and Methods Related to Coding Theory organized by: Novosibirsk State University, Novosibirsk, Russia Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Russia Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Bulgaria is inviting you to its next meeting to be held on March 2, 2021 at 1 p.m. Prof. Peter Boyvalenkov, Institute of Mathematics and Informatics, Bulgarian Academy of Sciences will deliver a talk on: 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 [...]

2021-02-28T21:52:13+02:00Sunday, 28 February 2021|Categories: |Tags: , |

Online seminar: Problems and Methods Related to Coding Theory

As part of the online seminar Problems and Methods Related to Coding Theory organized by: the Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Bulgaria the Novosibirsk State University, Novosibirsk, Russia the Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Russia on February 2, 2021, 1:00 pm Sofia (6:00 pm Novosibirsk, 2:00 pm Moscow) Prof. Sergey Avgustinovich, Sobolev Institute of Mathematics, Novosibirsk, Russia will deliver a talk on: Совершенные раскраски циркулянтных графов (Perfect colorings of circulant graphs). Abstract: A Cayley graph of the infinite cyclic group having generators d1, d2, d3, …, dn is called circulant. It is denoted by С∞(d1, d2, d3, …, dn). A coloring of the vertex set of a graph is called perfect if [...]

2021-01-29T14:11:42+02:00Friday, 29 January 2021|Categories: , |Tags: |
Go to Top