See by year See by month Jump to month

Carolin Hannusch (University of Debrecen): On some classes of binary error-correcting codes, their features and their applications in cryptography

Download as iCal file
Wednesday, 16. May 2018, 10:00 - 12:00
Abstract. We will construct some new classes of binary codes, which were introduced in [1], [2] and [3]. After introducing the constructions of these codes in modular group algebras we will talk about their features and possible applications in cryptographic systems. Some results mentioned in this talk were achieved in joint work with Piroska Lakatos and some results mentioned 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 Mathematics 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-correcting codes, in preparation.
Location : Bolyai Intézet, I. emelet, Riesz terem, Aradi Vértanúk tere 1., Szeged

Back

JEvents v3.1.8 Stable   Copyright © 2006-2013