 XOR convolution

For arrays indexed by $b$-bit nonnegative integers, their XOR convolution is $(a{\ast }_{\oplus }c{)}_r={\sum }_i{a}_i{c}_{i\oplus r}$, where $\oplus$ is bitwise exclusive or. If entries count choices of Grundy numbers, its repeated application counts sums of impartial games with a specified combined Grundy number. The Hadamard transform turns this operation into pointwise multiplication.