On logic networks allowing short single fault detection tests under arbitrary faults of gates

It is proved that one can implement any non-constant Boolean function in $n$ variables by an irredundant logic network in the basis $\{\&,\oplus,\neg\}$, containing not more than one dummy input variable and allowing a single fault detection test with length not more than $2n+3$ regarding arbitrary faults of logic gates.