Walsh transforms, balanced sum theorems and partition coefficients over multary alphabets

In this note, we indicate how the basic machinery of Walsh transforms can be generalized from the binary case ([3, 4]) to multary alphabets. Our main results show how Walsh coefficients are related to partition coefficients and how they may be used to calculate schema averages.