American Psychological Association 6th edition

Nagy, G. P. (2025). On the minimum Hamming distance between vectorial Boolean and affine functions. Cryptography and Communications: Discrete Structures, Boolean Functions and Sequences, 1-18. https://doi.org/10.1007/s12095-025-00808-4

ISO-690 (author-date, English)

NAGY, Gábor P., 2025. On the minimum Hamming distance between vectorial Boolean and affine functions. Cryptography and Communications: Discrete Structures, Boolean Functions and Sequences. 10 July 2025. P. 1-18. DOI 10.1007/s12095-025-00808-4.

Modern Language Association 9th edition

Nagy, G. P. “On the Minimum Hamming Distance Between Vectorial Boolean and Affine Functions”. Cryptography and Communications: Discrete Structures, Boolean Functions and Sequences, July 2025, pp. 1-18, https://doi.org/10.1007/s12095-025-00808-4.

Mohr Siebeck - Recht (Deutsch - Österreich)

Nagy, Gábor P.: On the minimum Hamming distance between vectorial Boolean and affine functions, Cryptography and Communications: Discrete Structures, Boolean Functions and Sequences 2025, 1-18.

Emerald - Harvard

Nagy, G.P. (2025), “On the minimum Hamming distance between vectorial Boolean and affine functions”, Cryptography and Communications: Discrete Structures, Boolean Functions and Sequences, pp. 1-18.

Warning: These citations may not always be 100% accurate.