Extended quadratic truncated rotation symmetric Boolean functions

A Boolean function in n variables x1,…,xn is rotation symmetric (RS) if the function is invariant under cyclic rotation of the variables. If the function is generated by a single monomial it is called monomial rotation symmetric (MRS). An MRS function is called truncated rotation symmetric (TRS) if the expansion for the n terms of the MRS function is stopped at the first term where xn occurs. This paper studies extended TRS functions, which are generated by adding the next monomial in the expansion of the MRS function to the TRS function. For example, the MRS function in 5 variables generated by x1x3 gives the TRS function x1x3+x2x4+x3x5 and the extended TRS function x1x3+x2x4+x3x5+x1x4. It is shown that the Hamming weights of any quadratic TRS function satisfy the same linear recursion as the weights of the corresponding extended TRS function, and also that the weights for the two functions are very frequently equal. The problem of finding the Dickson form (very difficult for a general quadratic function) for any quadratic extended TRS function is solved and an explicit generating function for the weights of any quadratic extended TRS function is found.