BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//jEvents 2.0 for Joomla//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:Europe/Budapest
END:VTIMEZONE
BEGIN:VEVENT
UID:4u83o4rnsc2ug9kulbaao9jic3@google.com
CATEGORIES:{lang hu}Algebra szeminárium{/lang}{lang en}Algebra seminar{/lang}
SUMMARY:Carolin Hannusch (University of Debrecen): On some classes of binary error-correcting codes, their features and their applications in cryptography
LOCATION:Bolyai Intézet, I. emelet, Riesz terem, Aradi Vértanúk tere 1., Szeged
DESCRIPTION;ENCODING=QUOTED-PRINTABLE:Abstract. We will construct some new classes of binary codes, which were in
troduced in [1], [2] and [3]. After introducing the constructions of these
codes in modular group algebras we will talk about their features and possi
ble applications in cryptographic systems. Some results mentioned in this t
alk were achieved in joint work with Piroska Lakatos and some results menti
oned in this talk were achieved in joint work with Pál Dömösi and Géza Horv
áth.

Bibliography

[1] Hannusch, C.: On monomial codes in
modular group algebras, Discrete Mathematics Vol 350 No. 5, 957-962 (2017).

[2] Hannusch, C., and Lakatos, P.: Construction of self-dual radical 2
-codes of given distance, Discrete Mathematics, Algorithms and Applications
4, 1250052 (2012).

[3] Hannusch, C., and Lakatos, P.: Construction of
self-dual binary (2^{2k}, 2^{2k−1} , 2^k)-codes, Algebra and Discrete Mathe
matics Vol.21 Nr.1, pp.59-68 (2016).

[4] Dömösi, P., Hannusch, C., Horv
áth, G.: A McEliece cryptosystem based on a new class of binary error-corre
cting codes, in preparation.
DTSTAMP:20191117T042830Z
DTSTART;TZID=Europe/Budapest:20180516T100000
DTEND;TZID=Europe/Budapest:20180516T120000
SEQUENCE:0
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR