problems and methods related to coding theory – Institute of Mathematics and Informatics

Seminar on Problems and Methods Related to Coding Theory

The seminar on Problems and Methods Related to Coding Theory organized by: Department of Mathematical Foundations of Informatics, Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Bulgaria Novosibirsk State University, Novosibirsk, Russia Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Russia is inviting you to its next meeting. Assist. Prof. Ivan Mogilnykh, Novosibirsk State University, will deliver a talk on: Completely regular codes in Johnson and Grassmann graphs Abstract. Completely regular codes in Johnson and Grassmann graph are interrelated with t-designs. In this talk we give an introduction to these codes and discuss several old and recent results. Martin noted that any (k-1)-(n,k,1)-design D is a completely regular code in the Johnson graph J(n,k). Avgustinovich and Mogilnykh showed [...]

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 [...]