Short single fault detection tests for logic networks under arbitrary faults of gates

It was proved that one can implement any non-constant Boolean function in $n$ variables by an irredundant logic network in the basis $\{\&,\oplus,\neg\}$, allowing, when $n\geqslant 3$, a single fault detection test with length not more than $6n-10$ relative to arbitrary faults of gates.