Open AccessWalsh transforms, balanced sum theorems and partition coefficients over multary alphabets
Author(s) -
M. T. Iglesias,
Bart Naudts,
A. Verschoren,
Concepción Vidal
Publication year - 2005
Publication title -
citeseer x (the pennsylvania state university)
Language(s) - English
Resource type - Conference proceedings
ISBN - 1-59593-010-8
DOI - 10.1145/1068009.1068220
Subject(s) - walsh function , partition (number theory) , binary number , mathematics , schema (genetic algorithms) , discrete mathematics , algorithm , arithmetic , computer science , combinatorics , machine learning
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom