Tudóstér: Hannusch Carolin publikációi

Csernoch, M., Nagy, T., Nagy, K., Csernoch, J., Hannusch, C.: Human-centered digital sustainability: handling enumerated lists in digital texts.
IEEE Access. 12 30544-30561, 2024.

Hussain, A., 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

Hannusch, C., Major, S.: Neighborhoods of Binary Self-Dual Codes.
Contemp. Math. 4 (4), 1174-1179, 2023.

Hannusch, C., Pethő, A.: Rotation on the digital plane.
Period. Math. Hung. 86 (2), 564-577, 2023.

Hannusch, C., Mihálydeák, T.: Algebraic structures gained from rough approximation in incomplete information systems.
In: Annals of Computer Science and Information Systems (ACSIS) ISBN: 9788396589743

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.

Falcone, G., Figula, Á., Hannusch, C.: On the generating matrices of Goppa codes over hyperelliptic curves.
JRMS. 37 (3), 273-279, 2022.

Hannusch, C., Major, S.: 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, Online kiadás, 103-106, 2022.

Falcone, G., Figula, Á., Hannusch, C.: Explicit Bases of the Riemann-Roch Spaces on Divisors on Hyperelliptic Curves.

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.

Falcone, G., Figula, Á., Hannusch, C.: Steiner Loops of Affine Type.
Results Math. 75 (4), 1-25, 2020.

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.

Fülöp, D., Hannusch, C.: Algorithm for the generation of complement-free sets.
Ann. Math. Inform. 50 89-92, 2019.

Hannusch, C.: A symmetric cryptosystem based on Reed-Solomon codes.
Int. J. Latest Eng. Res. Appl. 4 (11), 9-12, 2019.

Hannusch, C.: On monomial codes in modular group algebras.
Discret. Math. 340 (5), 957-962, 2017.

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.

Halasi, Z., Hannusch, C., Nguyen, H.: The largest character degrees of the symmetric and alternating groups.
Proc. Amer. Math. Soc. 144 (5), 1947-1960, 2016.

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.