BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Institute of Mathematics and Informatics - ECPv6.0.8//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Institute of Mathematics and Informatics
X-ORIGINAL-URL:https://math.bas.bg
X-WR-CALDESC:Събития за Institute of Mathematics and Informatics
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Europe/Sofia
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:EEST
DTSTART:20210328T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20211031T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Sofia:20210330T130000
DTEND;TZID=Europe/Sofia:20210330T143000
DTSTAMP:20260427T173514
CREATED:20210324T184126Z
LAST-MODIFIED:20210324T184126Z
UID:10375-1617109200-1617114600@math.bas.bg
SUMMARY:Семинар “Problems and Methods Related to Coding Theory“
DESCRIPTION:Семинарът  \nProblems and Methods Related to Coding Theory\,\nорганизиран от \nИМИ – БАН\, Секция “Математически основи на информатиката”\, \n Novosibirsk State University\, Novosibirsk\, Russia\, и \n Sobolev Institute of Mathematics\, Siberian Branch of  the Russian Academy of Sciences\, Novosibirsk\, Russia \nВи кани на поредната си сбирка\, на която \nAssist. Prof. Ivan Mogilnykh\, Novosibirsk State University\,\nще изнесе доклад на тема: \nCompletely regular codes in Johnson and Grassmann graphs\nAbstract. 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 that {B:|B|=k+1\, B does not contain any blocks of D} is a completely regular code in J(n\,k+1). \nWe prove that when D is the Steiner quadruple system of the extended Hamming code of length n one can obtain the following completely regular code in J(n\,6): {B:|B|=6\, B does not contain any blocks of D}. \nAnalogous ideas yield a completely regular code in Grassmann graph Jq(n\,4) from Desarguesian line spread. \nСтраница на семинара: http://www.math.bas.bg/moiuser/PMCT/ \n Семинарът ще се проведе онлайн на 30 март (вторник) 2021 г. от 13:00 часа. \nJoin Zoom Meeting \nhttps://us02web.zoom.us/j/85193428253?pwd=NzIycEVQb0NEMzFReVE1aTVOU3JWQT09\nZoom ID: 851 9342 8253\nPasscode: 970063
URL:https://math.bas.bg/event/%d1%81%d0%b5%d0%bc%d0%b8%d0%bd%d0%b0%d1%80-problems-and-methods-related-to-coding-theory-2/
LOCATION:Zoom
CATEGORIES:Работен семинар,Редовен семинар
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Sofia:20210302T130000
DTEND;TZID=Europe/Sofia:20210302T143000
DTSTAMP:20260427T173514
CREATED:20210228T195213Z
LAST-MODIFIED:20210228T195213Z
UID:10215-1614690000-1614695400@math.bas.bg
SUMMARY:Семинар “Problems and Methods Related to Coding Theory“
DESCRIPTION:Семинарът  \nProblems and Methods Related to Coding Theory\nОрганизиран от \nИМИ – БАН\, Секция “Математически основи на информатиката”\, \n Novosibirsk State University\, Novosibirsk\, Russia\, и \n Sobolev Institute of Mathematics\, Siberian Branch of  the Russian Academy of Sciences\, Novosibirsk\, Russia \nВи кани на поредната си сбирка\, която ще се проведе онлайн на 02 март 2021 г. от 13:00 часа. \nПетър Бойваленков\, ИМИ-БАН\,\nще изнесе доклад на тема: \nUniversal Bounds for Cardinality and Energy of Codes of Given Minimum and Maximum Distances\nAbstract. 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. \nJoint work with Peter Dragnev\, Douglas Hardin\, Edward Saff\, Maya Stoyanova \nСтраница на семинара: http://www.math.bas.bg/moiuser/PMCT/ \nТеТ\nJoin Zoom Meeting \nZoom ID: 910 5863 2644 \nPassword: 12624120 \nhttps://zoom.us/j/91058632644?pwd=Q3FZa29SV0pTUTZ5bEl1WGwyQU8xUT09
URL:https://math.bas.bg/event/%d1%81%d0%b5%d0%bc%d0%b8%d0%bd%d0%b0%d1%80-problems-and-methods-related-to-coding-theory/
LOCATION:Zoom
CATEGORIES:Работен семинар
ORGANIZER;CN="%D0%98%D0%BD%D1%81%D1%82%D0%B8%D1%82%D1%83%D1%82%20%D0%BF%D0%BE%20%D0%BC%D0%B0%D1%82%D0%B5%D0%BC%D0%B0%D1%82%D0%B8%D0%BA%D0%B0%20%D0%B8%20%D0%B8%D0%BD%D1%84%D0%BE%D1%80%D0%BC%D0%B0%D1%82%D0%B8%D0%BA%D0%B0%20-%20%D0%91%D0%90%D0%9D":MAILTO:office@math.bas.bg
END:VEVENT
END:VCALENDAR