A cyclic approach to bent functions (Q2721260)

A bent function, or more precisely, its ``truth table'', can be identified with a particular code-word of a (binary) Reed-Muller code and since the punctured Reed-Muller code is known to be cyclic, it is natural to ask if this last property is reflected on the bent functions. Using this approach, in this paper some properties of bent functions are described in a simple form by means of the ideal representation of the Reed-Muller code. It is shown that bent functions are closed under cyclic shifts and self-products. As a consequence bent functions in the same number of variables are constructed in a very easy and systematic way.NEWLINENEWLINEFor the entire collection see [Zbl 0948.00027].