Publication
Title
Walsh transforms, balanced sum theorems and partition coefficients over multary alphabets
Author
Abstract
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.
Language
English
Source (book)
Genetic and Evolutionary Computation Conference, June 25-29, 2005, Washington, D.C.
Publication
New York, N.Y. : Assoc Computing Machinery, 2005
ISBN
1-59593-010-8
Volume/pages
p. 1303-1308
ISI
000242040700186
UAntwerpen
Faculty/Department
Research group
Publication type
Subject
Affiliation
Publications with a UAntwerp address
External links
Web of Science
Record
Identification
Creation 24.02.2012
Last edited 13.09.2017
To cite this reference