On a Lower Bound for The Redundancy of Reliable Networks With Noisy Gates

IEEE Transactions on Information Theory

Volumn 37, Issue 3, 1991, Pages 639-643

  Pippenger, Nicholas ^a   Stamoulis, George D ^b   Tsitsiklis, John N ^b  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

noisy gates; parity function; Reliable computation

Indexed keywords

LOGIC DEVICES--GATES; RELIABILITY;

LOGARITHMIC REDUNDANCY FACTOR; LOWER BOUNDS; NOISY GATES; PARITY FUNCTION; REDUNDANCY; RELIABLE COMPUTATION;

LOGIC CIRCUITS;

EID: 0026156112     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.79921     Document Type: Article

References (5)

1. R. L. Dobrushin and S. I. Ortyukov, “Lower bound for the redundancy of self-correcting arrangements of unreliable functional elements,” Prob. Inf. Trans., vol. 13, pp. 59–65, 1977.
2. “Upper bound for the redundancy of self-correcting arrangements of unreliable functional elements,” Prob. Inf. Trans., vol. 13, pp. 203–218, 1977.
3. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
4. J. von Neumann, “Probabilistic logics and the synthesis of reliable organization from unreliable components,” in Automata Studies, C. E. Shannon and J. McCarthy, Eds. Princeton, NJ: Princeton University Press, 1956, pp. 329–378.
5. N. Pippenger, “On networks of noisy gates,” in Proc. 26th Ann. Symp. Foundations Comput Sci., 1985, pp. 30–36.