DocumentCode
1256841
Title
On a lower bound for the redundancy of reliable networks with noisy gates
Author
Pippenger, Nicholas ; Stamoulis, George D. ; Tsitsiklis, John N.
Author_Institution
Dept. of Comput. Sci., British Columbia Univ., Vancouver, BC, Canada
Volume
37
Issue
3
fYear
1991
fDate
5/1/1991 12:00:00 AM
Firstpage
639
Lastpage
643
Abstract
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.
Keywords
Boolean functions; information theory; redundancy; Boolean functions; logarithmic redundancy factor; lower bound; noisy gates; parity function; redundancy; reliable networks; Boolean functions; Computer networks; Decision feedback equalizers; Error probability; Fading; Redundancy; Upper bound;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.79921
Filename
79921
Link To Document