Abstract For Boolean functions f of special form, we obtain an upper estimate for the length D (f) of a fault detection test if f is implemented by circuits of gates in the Zhegalkin basis with constant type-1 faults at gate outputs. As a corollary, D (f) ≤ n k − 1 (k − 2) ! + 1 D (f) n^k-1 (k-2) !+1 for functions f of n ≥ k variables whose Zhegalkin polynomial is of degree at most k.
Yuliya V. Borodina (Wed,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: