Cart (Loading....) | Create Account
Close category search window

Reliable computation by networks in the presence of noise

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Feder, T. ; Dept. of Comput. Sci., Stanford Univ., CA, USA

Lower bounds on the depth of Boolean networks that can compute reliably in the presence of randomly occurring failures are proved. A bound is also given on the reliability that error-tolerant networks can achieve: this bound implies a limit strictly smaller than 1/2 on the failure probability per gate that can be tolerated. The results improve upon recently published bounds of N. Pippenger (ibid., vol.IT-34, p.194-7, 1988) on the depth of error-tolerant formulas and extend the bounds to the case of reliable computation by networks

Published in:

Information Theory, IEEE Transactions on  (Volume:35 ,  Issue: 3 )

Date of Publication:

May 1989

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.