Abstract
We introduce infinite sequences of Boolean functions whose terms all are bent functions or all are near-bent functions.
Similar content being viewed by others
Explore related subjects
Discover the latest articles and news from researchers in related subjects, suggested using machine learning.References
Canteault, A., Charpin, P.: Decomposing Bent Functions. IEEE Trans. Inf. Theory 49, 2004–2019 (2003)
Dillon, J.F.: Elementary Hadamard Difference Sets. Ph.D. Thesis, University of Maryland (1974)
Kerdock, A.M.: A class of low-rate non linear codes. Inf. Control. 20, 182–187 (1972)
Leander, G., McGuire, G.: Construction of Bent Functions from Near-Bent Functions. J. Comb. Theory Ser. A 1164, 960–970 (2009)
Mac Williams, F.J., Sloane, N.J.A.: The Theory of Error Correcting Codes. North-Holland, Amsterdam (1977)
Rothaus, O.S.: On bent functions. J. Comb. Theory Ser. A 20, 300–305 (1976)
Wolfmann, J.: Bent Functions and Coding Theory. Difference Sets, Sequences and their Correlation properties Pott, A., Kumar, P.V., Helleseth, T., Jungnickel, D. (eds.) . NATO Sciences Series, Series C,542, Kluwer Academic Publishers,393–418 (1999)
Wolfmann, J.: Cyclic code aspects of bent functions.Finite Fields: Theory and Applications. AMS Ser. Contemp. Math. 518, 363–384 (2010)
Wolfmann, J.: Special Bent and Near-Bent Functions. Adv. Math. Commun. 8 (1), 21–33 (2014)
Wolfmann, J.: From Near-Bent to Bent: A special Case. Topics in Finite Fields, AMS series. Contemp. Math. 632, 359–371 (2015)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Wolfmann, J. Sequences of bent functions and near-bent functions. Cryptogr. Commun. 9, 729–736 (2017). https://doi.org/10.1007/s12095-017-0212-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12095-017-0212-2