EN HU
logo Tudóstér

Hannusch Carolin

Hannusch Carolin
DE
Informatikai Kar
adjunktus 2018-
DE IK
Számítógéptudományi Tanszék
adjunktus 2018-

Teljes publikációs lista

Tudóstér társszerzők statisztika szűrhető publikációs lista
Feltöltött közlemény:
21
DEA-ban:
21
OA:
11
Publikációs időszak:
2012-2026
2026
1.
Csernoch, M., Hannusch, C.: Problem-solving strategies of teachers and students in digital text management.
Humanit Soc Sci Commun. [Epub ahead of print], 2026.
doi DEA
Folyóirat-mutatók:
D1 Arts and Humanities (miscellaneous) (2025)
Q1 Business, Management and Accounting (miscellaneous) (2025)
Q1 Economics, Econometrics and Finance (miscellaneous) (2025)
Q1 Psychology (miscellaneous) (2025)
Q1 Social Sciences (miscellaneous) (2025)
2025
2.
Hannusch, C., Major, S. R., Pavone, M.: Algorithm for the fast generation of Latin squares.
J. Discret. Math. Sci. Cryptogr. 29 (1), 127-137, 2025.
doi DEA
Folyóirat-mutatók:
Q3 Algebra and Number Theory
Q3 Analysis
Q3 Applied Mathematics
3.
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.
doi DEA
Folyóirat-mutatók:
Q2 Applied Mathematics
Q2 Computational Theory and Mathematics
Q2 Computer Networks and Communications
Q2 Computer Science Applications
Q2 Software
2024
4.
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.
doi DEA WoS Scopus
Folyóirat-mutatók:
Q1 Computer Science (miscellaneous)
Q1 Engineering (miscellaneous)
Q2 Materials Science (miscellaneous)
5.
Csernoch, M., Hannusch, C., Biró, P.: Modification of Erroneous and Correct Digital Texts.
Entropy. 26 (12), 1-21, (cikkazonosító: 1015), 2024.
doi DEA WoS Scopus
Folyóirat-mutatók:
Q2 Electrical and Electronic Engineering
Q2 Information Systems
Q2 Mathematical Physics
Q2 Physics and Astronomy (miscellaneous)
2023
6.
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
doi DEA Scopus
7.
Hannusch, C., Major, S. R.: Neighborhoods of Binary Self-Dual Codes.
Contemp. Math. 4 (4), 1174-1179, 2023.
doi DEA Scopus
Folyóirat-mutatók:
Q4 Applied Mathematics
Q4 Discrete Mathematics and Combinatorics
Q4 Geometry and Topology
Q4 Mathematical Physics
8.
Hannusch, C., Pethő, A.: Rotation on the digital plane.
Period. Math. Hung. 86 (2), 564-577, 2023.
doi DEA WoS Scopus
Folyóirat-mutatók:
Q2 Mathematics (miscellaneous)
2022
9.
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
doi DEA
10.
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.
doi DEA
11.
Falcone, G., Figula, Á., Hannusch, C.: On the generating matrices of Goppa codes over hyperelliptic curves.
JRMS. 37 (3), 273-279, 2022.
DEA WoS Scopus
Folyóirat-mutatók:
Q4 Mathematics (miscellaneous)
12.
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.
doi DEA Scopus
2021
13.
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.
doi DEA Scopus
Folyóirat-mutatók:
Q3 Computational Theory and Mathematics
Q3 Discrete Mathematics and Combinatorics
2020
14.
Falcone, G., Figula, Á., Hannusch, C.: Steiner Loops of Affine Type.
Results Math. 75 (4), 1-25, (cikkazonosító: 148), 2020.
doi DEA WoS Scopus
Folyóirat-mutatók:
Q2 Applied Mathematics
Q2 Mathematics (miscellaneous)
2019
15.
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.
doi DEA Scopus
Folyóirat-mutatók:
Q4 Mathematics (miscellaneous)
16.
Fülöp, D., Hannusch, C.: Algorithm for the generation of complement-free sets.
Ann. Math. Inform. 50, 89-92, 2019.
doi DEA WoS Scopus
Folyóirat-mutatók:
Q4 Computer Science (miscellaneous)
Q4 Mathematics (miscellaneous)
17.
Hannusch, C.: A symmetric cryptosystem based on Reed-Solomon codes.
Int. J. Latest Eng. Res. Appl. 4 (11), 9-12, 2019.
DEA
2017
18.
Hannusch, C.: On monomial codes in modular group algebras.
Discret. Math. 340 (5), 957-962, 2017.
doi DEA WoS Scopus
Folyóirat-mutatók:
Q1 Discrete Mathematics and Combinatorics
Q1 Theoretical Computer Science
2016
19.
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.
DEA
Folyóirat-mutatók:
Q4 Algebra and Number Theory
Q4 Discrete Mathematics and Combinatorics
20.
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.
doi DEA
Folyóirat-mutatók:
Q1 Applied Mathematics
Q1 Mathematics (miscellaneous)
2012
21.
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.
doi DEA
DEENK Debreceni Egyetem
© 2012 Debreceni Egyetem
Ez a weboldal sütiket használ. Az Uniós törvények értelmében kérem, engedélyezze a sütik használatát, vagy zárja be az oldalt.