A Theory of Galois Switching Functions

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.

[1]  Shmuel Winograd,et al.  On the Time Required to Perform Addition , 1965, JACM.

[2]  George Epstein,et al.  The development of multiple-valued logic as related to computer science , 1974, Computer.

[3]  Thomas C. Bartee,et al.  Computation with Finite Fields , 1963, Inf. Control..

[4]  Shmuel Winograd,et al.  On the Time Required to Perform Multiplication , 1967, JACM.

[5]  Lawrence T. Fisher.  Unateness Properties of and-Exclusive-or Logic Circuits , 1974, IEEE Transactions on Computers.

[6]  Amar Mukhopadhyay,et al.  Minimization of Exclusive or and Logical Equivalence Switching Circuits , 1970, IEEE Transactions on Computers.

[7]  Otto Kolp.  The Synthesis of Multivalued Cellular Cascades and the Decomposability of Group Functions , 1972, IEEE Transactions on Computers.

[8]  James L. Massey,et al.  Review of 'Error-Correcting Codes, 2nd edn.' (Peterson, W. W., and Weldon, E. J., Jr.; 1972) , 1973, IEEE Trans. Inf. Theory.

[9]  Bernard Kolman,et al.  Galois Logic Design. , 1970 .

[10]  K. C. Wang.  Graphs of Linear Forms on Modules over Boolean Rings , 1967, IEEE Trans. Electron. Comput..

[11]  C. V. Ramamoorthy.  Procedures for minimization of "exclusive-OR" and "logical-equivalence" switching circuits , 1965, SWCT.

[12]  SUDHAKAR M. REDDY,et al.  Easily Testable Realizations ror Logic Functions , 1972, IEEE Transactions on Computers.

[13]  Kolar L. Kodandapani,et al.  Reed-Muller Canonical Forms in Multivalued Logic , 1975, IEEE Trans. Computers.

[14]  Shimon Even,et al.  On Minimal Modulo 2 Sums of Products for Switching Functions , 1966, SWAT.

[15]  S. M Reddy,et al.  Easily testable realizations for logic functions , 1973 .

[16]  David E. Muller,et al.  Application of Boolean algebra to switching circuit design and to error detection , 1954, Trans. I R E Prof. Group Electron. Comput..

[17]  H. B. Mann.  Error-Correcting Codes , 1972 .

[18]  Karl S. Menger,et al.  A Transform for Logic Networks , 1969, IEEE Transactions on Computers.

[19]  Dhiraj K. Pradhan,et al.  Reed-Muller Like Canonic Forms for Multivalued Functions , 1975, IEEE Transactions on Computers.

[20]  Irving S. Reed,et al.  Galois Switching Functions and Their Applications , 1975, IEEE Transactions on Computers.

[21]  Grigore C. Moisil.  The algebraic theory of switching circuits , 1969 .

[22]  J. Taylor,et al.  Switching and finite automata theory, 2nd ed. , 1980, Proceedings of the IEEE.

[23]  Craig K. Rushforth,et al.  A Cellular-Array Multiplier for GF(2m) , 1971, IEEE Transactions on Computers.

[24]  Irving S. Reed,et al.  A class of multiple-error-correcting codes and the decoding scheme , 1954, Trans. IRE Prof. Group Inf. Theory.