Abstract
Boolean matrix transforms between the parity spectrum and modulo-2 canonical expansions of a Boolean function are considered. Using a Kronecker matrix product approach, fast recursive algorithms derived for these and other transforms are applied to the minimisation of modulo-2 canonical expansions.

This publication has 0 references indexed in Scilit: