Affine equivalence for quadratic rotation symmetric Boolean functions (Q780372): Difference between revisions

A function \(f\) from \(\mathbb{F}_2^n\) to \(\mathbb{F}_2\) is called rotation symmetric (RS) if \(f(x_0,x_1,\ldots,x_{n-1}) = f(x_1,\ldots,x_{n-1},x_0)\) for all \((x_0,x_1,\ldots,x_{n-1})\in\mathbb{F}_2^n\). An RS function \(f\) is called monomial rotation symmetric (MRS) if \(f\) is generated by a monomial (the algebraic normal form of \(f\) consists of the shifts of one monomial). The authors investigate a recursion formula for the weights of quadratic RS functions. As application, the authors show statements on balancedness of quadratic RS functions, the number of affine equivalence classes of quadratic MRS functions is given.