Easily testable multiple-valued logic circuits derived from Reed-Muller circuits

S.M. Reddy (1972) showed that the binary circuits realizing Reed-Muller canonical form are easily testable. In this paper, we extend Reddy´s result to multiple-valued logic circuits, employing more than two discrete levels of signal. The electronic fabrication of such circuits became feasible due to the recent advances in integrated circuit technology. We show that, in the multiple-valued case, several new phenomena occur which allow us to asymptotically reduce the upper bound on the number of tests required for fault detection, but make the generation of tests harder.