Abstract
Communication over unknown discrete memoryless channels with instantaneous and perfect feedback is considered. For a given set of channels we define a notion of optimal coding schemes in terms of achievable rate and error exponent, and prove the existence of such coding schemes for two families of channels.
| Original language | English |
|---|---|
| Pages (from-to) | 379 |
| Number of pages | 1 |
| Journal | IEEE International Symposium on Information Theory-Proceedings |
| Publication status | Published - 20 Oct 2004 |
| Externally published | Yes |
| Event | Proceedings - 2004 IEEE International Symposium on Information Theory - Chicago, IL, United States Duration: 27 Jun 2004 → 2 Jul 2004 |