On the Maximum Tolerable Noise of k-Input Gates for Reliable Computation by Formulas

IEEE Transactions on Information Theory

Volumn 49, Issue 11, 2003, Pages 3094-3098

  Evans, William S ^a   Schulman, Leonard J ^b  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Computation by unreliable components; Reliable computing

Indexed keywords

APPROXIMATION THEORY; BOOLEAN FUNCTIONS; ERROR CORRECTION; PROBABILITY; THEOREM PROVING; VECTORS;

GATE NOISE;

LOGIC GATES;

EID: 0344443801     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2003.818405     Document Type: Article

References (6)

1. J. von Neumann, "Probabilistic logics and the synthesis of reliable organizms from unreliable components," in Automata Studies, C. E. Shannon and J. McCarthy, Eds. Princeton, NJ: Princeton Univ. Press, 1956, pp. 43-98.
2. N. Pippenger, "Reliable computation by formulas in the presence of noise," IEEE Trans. Inform. Theory, vol. 34, pp. 194-197, Mar. 1988.
3. T. Feder, "Reliable computation by networks in the presence of noise," IEEE Trans. Inform. Theory, vol. 35, pp. 569-571, May 1989.
4. W. Evans and L. J. Schulman, "Signal propagation and noisy circuits," IEEE Trans. Inform. Theory, vol. 45, pp. 2367-2373, Nov. 1999.
5. B. Hajek and T. Weller, "On the maximum tolerable noise for reliable computation by formulas," IEEE Trans. Inform. Theory, vol. 37, pp. 388-391, Mar. 1991.
6. W. Evans and N. Pippenger, "On the maximum tolerable noise for reliable computation by formulas," IEEE Trans. Inform. Theory, vol. 44, pp. 1299-1305, May 1998.