Referenced Items are not available for this document.
We show that any distributed protocol which runs on a noiseless network in time T, can be simulated on an identical noisy network with a slow-down factor proportional to log(d+1), where d is the maximum degree in the network, and with exponentially small probability of error. On every channel of our network we implement communications using tree codes
Published in:
Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on
Date of Conference: 17-22 Sep 1995
- Meeting Date :
- 17 Sep 1995-22 Sep 1995
- Print ISBN:
- 0-7803-2453-6
- INSPEC Accession Number:
- 5280200
- Conference Location :
- Whistler, BC
- Digital Object Identifier :
- 10.1109/ISIT.1995.550440
- Product Type:
- Conference Publications
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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
