Abstract:
It is proved that one can implement in the Zhegalkin basis any system of two Boolean functions by a Boolean circuit, which is irredundant and allows a single fault detection test with length no more than $3$ in the case of arbitrary stuck-at faults at outputs of gates.