Publications

  • H. Ahmad, C. Hannusch, A symmetric cryptographic scheme based on latin squares and error correcting codes, submitted
  • M. Csernoch, P. Biró, C. Hannusch, Modification of erroneous and correct digital texts, submitted
  • C. Hannusch, S.R. Major, M. Pavone, Algorithm for the fast generation of latin squares, submitted
  • C. Hannusch, The Feit-Thompson conjecture: An example for mathematical research based on contradictory sources, 10.20944/preprints202403.1214.v1
  • C. Hannusch, S.R. Major, Concept and algorithm for constructing binary linear codes using hereditary properties of generating matrices, submitted
  • G. Filippone, C. Hannusch, Decoding algorithm for a class of binary error-correcting codes, submitted (eprint available http://arxiv.org/abs/2303.09820)
  • M. Csernoch, T. Nagy, K. Nagy, J. Csernoch, C. Hannusch, Human-centered digital sustainability: handling enumerated lists in digital texts, IEEE Access. 12 30544-30561, (2024) DOI 10.1109/ACCESS.2024.3369587 Link
  • C. Hannusch, S.R. Major, Neighborhoods of binary self-dual codes (eprint available: arXiv 2206.05588), Contemporary Mathematics, Volume 4 Issue 4 (2023), DOI 10.37256/cm.4420232397, Paper
  • C. Hannusch, A. Pethő, Rotation on the digital plane, Periodica Mathematica Hungarica 86 (2), 564-577 (2023), DOI 10.1007/s10998-022-00480-8, Paper
  • H. Ahmad, C. Hannusch, A New Keyed Hash Function Based on Latin Squares and Error-Correcting Codes to Authenticate Users in Smart Home Environments. In: El Hajji, S., Mesnager, S., Souidi, E.M. (eds) Codes, Cryptology and Information Security. C2SI 2023. Lecture Notes in Computer Science, vol 13874. Springer, Cham. https://doi.org/10.1007/978-3-031-33017-9_8 Paper
  • C. Hannusch, T. Mihálydeák, Algebraic structures gained from rough approximation in incomplete information systems, DOI: http://dx.doi.org/10.15439/2022F90; Citation: Communication Papers of the 17th Conference on Computer Science and Intelligence Systems, M. Ganzha, L. Maciaszek, M. Paprzycki, D. Ślęzak (eds). ACSIS, Vol. 32, pages 73-77 (2022) Paper
  • C. Hannusch and S. R. Major, "Torch: Software Package For The Search Of Linear Binary Codes," 2022 IEEE 2nd Conference on Information Technology and Data Science (CITDS), 2022, pp. 103-106, doi: 10.1109/CITDS54976.2022.9914052 Paper
  • K. Ficzere, Á. Figula, C. Hannusch, E. Kása, Lehre der Trigonometrie anhand realistischer Aufgaben im Online-Unterricht, Teaching Mathematics and Computer Science, 20/1 (2022), 87–105, DOI 10.5485/TMCS.2022.0538 Paper
  • G. Falcone, Á. Figula, C. Hannusch, On the generating matrices of Goppa codes over hyperelliptic curves, J. Ramanujan Math. Soc. 37, No.3 (2022) 273–279 (eprint available arXiv 2012.08870) Paper
  • C. Hannusch, G. Horváth, Properties of hash functions based on Gluskov product of automata, Journal of Automata, Languages, and Combinatorics 26, 1-2, pp. 55-65 (2021), doi: 10.25596/jalc-2021-055 Paper
  • G. Falcone, Á. Figula, C. Hannusch, Steiner loops of affine type, Results in Mathematics 75.4, 1-25 (2020) Paper
  • D. Fülöp, C. Hannusch, Algorithm for the generation of complement-free sets, doi: 10.33039/ami.2019.03.002, Annales Mathematicae et Informaticae 50 (2019) pp. 89-92. Paper
  • C. Hannusch, A symmetric cryptosystem based on RS-codes, International Journal of Latest Engineering Research and Applications, pp 09 - 12, Vol 04 - No. 11 (2019) Paper
  • P. Dömösi, C. Hannusch, G. Horváth, A cryptographic system based on a new class of binary error-correcting codes, Tatra Mountains Mathematical Publications 73 (2019) DOI 10.2478/tmmp-2019-0007 Paper
  • C. Hannusch, Monomial codes in the radical of modular group algebras and their properties, PhD dissertation (2017) Dissertation
  • C. Hannusch, On monomial codes in modular group algebras, Discrete Mathematics Vol 350 No. 5 (2017), 957-962 Paper
  • C. Hannusch and P. Lakatos, Construction of self-dual binary [2^{2k},2^{2k-1},2^k]-codes, Algebra and Discrete Mathematics Vol. 21 No. 1 (2016), 59-68 Paper
  • Z. Halasi, C. Hannusch and H. N. Nguyen, The largest character degrees of the symmetric and alternating groups, arXiv:1410.3055, Proc. Amer. Math. Soc. 144 (2016), 1947-1960 Paper
  • C. Hannusch and P. Lakatos, Construction of self-dual radical 2-codes of given distance, Discrete Mathematics, Algorithms and Applications 4 (2012), 1250052. Paper