Published June 2001
| Published
Book Section - Chapter
Open
On the complexity of reliable communication on the erasure channel
- Creators
- Khandekar, Aamod
- McEliece, Robert J.
Abstract
We discuss the complexity of achieving channel capacity on the binary erasure channel (BEC) in view of recent advances. We also extrapolate to conjecture complexity bounds on more general channels.
Additional Information
© 2001 IEEE. Meeting Date: 24 Jun 2001 - 29 Jun 2001. Date of Current Version: 07 August 2002.Attached Files
Published - KHAisit01.pdf
Files
KHAisit01.pdf
Files
(120.2 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:97748bb6dbc2fe48fb0397e6a9c505ee
|
120.2 kB | Preview Download |
Additional details
- Eprint ID
- 27630
- Resolver ID
- CaltechAUTHORS:20111104-122318374
- Created
-
2011-11-04Created from EPrint's datestamp field
- Updated
-
2021-11-09Created from EPrint's last_modified field