EN HU

Hannusch Carolin

Hannusch Carolin
DE
Informatikai Kar
adjunktus 2018-
DE IK

Teljes publikációs lista

2025
1.
Hannusch, C., Major, S. R., Pavone, M.: Algorithm for the fast generation of Latin squares.
J. Discret. Math. Sci. Cryptogr. [Epub ahead of print], 1-12, 2025.
Folyóirat-mutatók:
Q3 Algebra and Number Theory (2024)
Q3 Analysis (2024)
Q3 Applied Mathematics (2024)
2.
Ahmad, H., Hannusch, C.: A Scalable Symmetric Cryptographic Scheme Based on Latin Square, Permutations, and Reed-Muller Codes for Resilient Encryption.
Cryptography. 9 (4), 1-28, (cikkazonosító: 70), 2025.
Folyóirat-mutatók:
Q2 Applied Mathematics (2024)
Q2 Computational Theory and Mathematics (2024)
Q2 Computer Networks and Communications (2024)
Q2 Computer Science Applications (2024)
Q2 Software (2024)
2024
3.
Csernoch, M., Nagy, T. K., Nagy, K., Csernoch, J., Hannusch, C.: Human-centered digital sustainability: handling enumerated lists in digital texts.
IEEE Access. 12, 30544-30561, 2024.
Folyóirat-mutatók:
Q1 Computer Science (miscellaneous)
Q1 Engineering (miscellaneous)
Q2 Materials Science (miscellaneous)
4.
Csernoch, M., Hannusch, C., Biró, P.: Modification of Erroneous and Correct Digital Texts.
Entropy. 26 (12), 1-21, (cikkazonosító: 1015), 2024.
Folyóirat-mutatók:
Q2 Electrical and Electronic Engineering
Q2 Information Systems
Q2 Mathematical Physics
Q2 Physics and Astronomy (miscellaneous)
2023
5.
Ahmad, H., Hannusch, C.: A New Keyed Hash Function Based on Latin Squares and Error-Correcting Codes to Authenticate Users in Smart Home Environments.
In: Codes, Cryptology and Information Security: 4th International Conference, C2SI 2023, Rabat, Morocco, May 29-31, 2023, Proceedings. (Chapter 8) /Souidi El Mamoun (eds.), Springer Nature Switzerland, Cham, Svájc, 129-135, 2023. ISBN: 9783031330162
6.
Hannusch, C., Major, S. R.: Neighborhoods of Binary Self-Dual Codes.
Contemp. Math. 4 (4), 1174-1179, 2023.
Folyóirat-mutatók:
Q4 Applied Mathematics
Q4 Discrete Mathematics and Combinatorics
Q4 Geometry and Topology
Q4 Mathematical Physics
7.
Hannusch, C., Pethő, A.: Rotation on the digital plane.
Period. Math. Hung. 86 (2), 564-577, 2023.
Folyóirat-mutatók:
Q2 Mathematics (miscellaneous)
2022
8.
Hannusch, C., Mihálydeák, T. S.: Algebraic structures gained from rough approximation in incomplete information systems.
In: Annals of Computer Science and Information Systems (ACSIS) ISBN: 9788396589743
9.
Ficzere, K., Figula, Á., Hannusch, C., Kása, E.: Lehre der Trigonometrie anhand realistischer Aufgaben im Online-Unterricht.
Teach. math. comput. sci. 20 (1), 87-105, 2022.
10.
Falcone, G., Figula, Á., Hannusch, C.: On the generating matrices of Goppa codes over hyperelliptic curves.
JRMS. 37 (3), 273-279, 2022.
Folyóirat-mutatók:
Q4 Mathematics (miscellaneous)
11.
Hannusch, C., Major, S. R.: Torch: Software Package For The Search Of Linear Binary Codes.
In: 2022 IEEE 2nd Conference on Information Technology and Data Science (CITDS): Proceedings / Fazekas István, IEEE, Piscataway, 103-106, 2022.
2021
12.
Hannusch, C., Horváth, G.: Properties of hash functions based on Gluskov product of automata.
J. Autom. Lang. Comb. 26 (1-2), 55-65, 2021.
Folyóirat-mutatók:
Q3 Computational Theory and Mathematics
Q3 Discrete Mathematics and Combinatorics
2020
13.
Falcone, G., Figula, Á., Hannusch, C.: Steiner Loops of Affine Type.
Results Math. 75 (4), 1-25, (cikkazonosító: 148), 2020.
Folyóirat-mutatók:
Q2 Applied Mathematics
Q2 Mathematics (miscellaneous)
2019
14.
Dömösi, P., Hannusch, C., Horváth, G.: A Cryptographic System Based on a New Class of Binary Error-Correcting Codes.
Tatra Mt. Math. Publ. 73 (1), 83-96, 2019.
Folyóirat-mutatók:
Q4 Mathematics (miscellaneous)
15.
Fülöp, D., Hannusch, C.: Algorithm for the generation of complement-free sets.
Ann. Math. Inform. 50, 89-92, 2019.
Folyóirat-mutatók:
Q4 Computer Science (miscellaneous)
Q4 Mathematics (miscellaneous)
16.
Hannusch, C.: A symmetric cryptosystem based on Reed-Solomon codes.
Int. J. Latest Eng. Res. Appl. 4 (11), 9-12, 2019.
2017
17.
Hannusch, C.: On monomial codes in modular group algebras.
Discret. Math. 340 (5), 957-962, 2017.
Folyóirat-mutatók:
Q1 Discrete Mathematics and Combinatorics
Q1 Theoretical Computer Science
2016
18.
Hannusch, C., Lakatos, P.: Construction of self-dual binary [2^(2k),2^(2k-1),2^k] -codes.
Algebra Discrete Math. 21 (1), 59-68, 2016.
Folyóirat-mutatók:
Q4 Algebra and Number Theory
Q4 Discrete Mathematics and Combinatorics
19.
Halasi, Z., Hannusch, C., Nguyen, H. N.: The largest character degrees of the symmetric and alternating groups.
Proc. Amer. Math. Soc. 144 (5), 1947-1960, 2016.
Folyóirat-mutatók:
Q1 Applied Mathematics
Q1 Mathematics (miscellaneous)
2012
20.
Hannusch, C., Lakatos, P.: Construction of self-dual radical 2-codes of given distance.
Discrete Math. Algorithm. Appl. 4 (4), 1250052-1-1250052-13, 2012.
DEENK Debreceni Egyetem
© 2012 Debreceni Egyetem