Abstract
We show that the Lagrange dual of the problem of channel capacity with input cost for discrete memoryless channel is a simple and well-structured geometric program. The geometric program dual gives a new class of upper bounds of channel capacity that can be made arbitrarily tight and includes some known bounds as special cases, and a free energy interpretation to channel capacity.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 291 |
| Number of pages | 1 |
| Journal | IEEE International Symposium on Information Theory - Proceedings |
| State | Published - 2003 |
| Event | Proceedings 2003 IEEE International Symposium on Information Theory (ISIT) - Yokohama, Japan Duration: Jun 29 2003 → Jul 4 2003 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Information Systems
- Modeling and Simulation
- Applied Mathematics