Abstract
The validity of the proof of the converse of the previously proposed resolvability formula was seen to be hinged heavily on the assumption that the input alphabet of the channel is finite. This study aims to show that this restriction can be relaxed and the previous resolvability formula continues to hold also for a wide class of channels with continuous input alphabet, including a special case additive white Gaussian noise channels with power constraint P.
| Original language | English (US) |
|---|---|
| State | Published - 1994 |
| Event | Proceedings of the 1994 IEEE International Symposium on Information Theory - Trodheim, Norw Duration: Jun 27 1994 → Jul 1 1994 |
Other
| Other | Proceedings of the 1994 IEEE International Symposium on Information Theory |
|---|---|
| City | Trodheim, Norw |
| Period | 6/27/94 → 7/1/94 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Information Systems
- Modeling and Simulation
- Applied Mathematics