Reed-Muller-Fourier versus Galois field representations of four-valued logic functions

Abstract

In this paper, we introduce Reed-Muller-Fourier representations of four-valued functions over the ring of integers modulo 4 and compare them with the Galois field representations over GF(4). It is reported that on the average Reed-Muller-Fourier representations exhibit a lower complexity than those based on Galois field polynomials.