Khandekar, Aamod and McEliece, Robert J. (2001) On the complexity of reliable communication on the erasure channel. In: 2001 IEEE International Symposium on Information Theory. IEEE , Piscataway, NJ, p. 1. ISBN 0-7803-7123-2. https://resolver.caltech.edu/CaltechAUTHORS:20111104-122318374
![[img]](https://authors.library.caltech.edu/style/images/fileicons/application_pdf.png)
|
PDF
- Published Version
See Usage Policy. 117Kb |
Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20111104-122318374
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.
| Item Type: | Book Section | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Related URLs: |
| |||||||||
| Additional Information: | © 2001 IEEE. Meeting Date: 24 Jun 2001 - 29 Jun 2001. Date of Current Version: 07 August 2002. | |||||||||
| Record Number: | CaltechAUTHORS:20111104-122318374 | |||||||||
| Persistent URL: | https://resolver.caltech.edu/CaltechAUTHORS:20111104-122318374 | |||||||||
| Official Citation: | Khandekar, A.; McEliece, R.J.; , "On the complexity of reliable communication on the erasure channel ," Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on , vol., no., pp.1, 2001 doi: 10.1109/ISIT.2001.935864 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=935864&isnumber=20241 | |||||||||
| Usage Policy: | No commercial reproduction, distribution, display or performance rights in this work are provided. | |||||||||
| ID Code: | 27630 | |||||||||
| Collection: | CaltechAUTHORS | |||||||||
| Deposited By: | Tony Diaz | |||||||||
| Deposited On: | 04 Nov 2011 22:21 | |||||||||
| Last Modified: | 03 Oct 2019 03:25 |
Repository Staff Only: item control page
