A Theory of Galois Switching Functions
Pradhan · IEEE Transactions on Computers · 1978
Galois switching functions (GSF's) are generalizations of binary functions in that the input and output variables can assume values over any finite field. The concepts of minterms, k-cubes and minimal complexity realizations as related to GSF are introduced.