Published September 1995
| public
Book Section - Chapter
Coding for interactive communication
- Creators
-
Schulman, Leonard J.
Abstract
Let the input to a computation problem be split between two processors connected by a communication link; and let an interactive protocol π be known, by which on any input, the processors can solve the problem using no more than T transmissions of bits between them, provided the channel is noiseless. We study the following question: if in fact there is some noise on the channel, what is the effect upon the number of transmissions needed in order to solve the communication problem reliably?.
Additional Information
© 1995 IEEE. Date of Current Version: 06 August 2002. Supported in part by an NSF Postdoctoral Fellowship.Additional details
- Eprint ID
- 29450
- DOI
- 10.1109/ISIT.1995.550439
- Resolver ID
- CaltechAUTHORS:20120224-084221884
- NSF Postdoctoral Fellowship
- Created
-
2012-02-24Created from EPrint's datestamp field
- Updated
-
2021-11-09Created from EPrint's last_modified field
- Other Numbering System Name
- INSPEC Accession Number
- Other Numbering System Identifier
- 5280199