Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  prove that a logarithmic redundancy factor is necessary for the reliable computation of the parity function by means of a networks with noisy gates. This result is the same as one claimed by Dobrushin and Ortyukov in 1977, but the proof they gave appears to be incorrect.
['Nicholas Pippenger', 'George D. Stamoulis', 'John N. Tsitsiklis']
I am writing a research paper on a idea On a Lower Bound for the Redundancy of Reliable Networks with Noisy Gates
[{"from": "human", "value": "I am writing a research paper on a idea On a Lower Bound for the Redundancy of Reliable Networks with Noisy Gates"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  prove that a logarithmic redundancy factor is necessary for the reliable computation of the parity function by means of a networks with noisy gates. This result is the same as one claimed by Dobrushin and Ortyukov in 1977, but the proof they gave appears to be incorrect."}]