Galois Switching Functions and Their Applications
IEEE Transactions on Computers
Synthesis of Finite State Algorithms in a Galois Field GF[pn]
IEEE Transactions on Computers
Systolic product-sum circuit for GF((22)m) using neuron MOSFETs
Integration, the VLSI Journal
| Hi-index | 14.98 |
An alternative is provided to a recently published method of Benjauthrit and Reed for calculating the coefficients of the polynomial expansion of a given function. The method is exhibited for functions of one and two variables. The relative advantages and disadvantages of the two methods are discussed. Some empirical results are given for GF(9) and GF(16). It is shown that functions with DON'T CARE states are represented by a polynomial of minimal degree by this method.