Method of synthesis of easily testable circuits admitting single fault detection tests of constant length
Дмитрий Сергеевич Романов · Discrete Mathematics and Applications · 2014
It is constructively proved that any nonconstant Boolean function may be realized (over an arbitrary complete basis of gates) by a testable combinational circuit admitting (under single inverse or arbitrary constant faults at outputs of gates) a single fault detection test set whose cardinality does not exceed 4.