On a lower bound for the redundancy of reliable networks with noisy gates
Nicholas J. Pippenger, George D. Stamoulis, John N. Tsitsiklis · IEEE Transactions on Information Theory · 1991
A proof is provided that a logarithmic redundancy factor is necessary for the reliable computation of the parity function by means of a network with noisy gates. This result was first stated by R.L. Dobrushin and S.I. Ortyukov (1977). However, the authors believe that the analysis given by Dobrushin and Ortyukov is not entirely correct. The authors establish the result by following the same steps and by replacing the questionable part of their analysis with entirely new arguments.>