Abstract
The duality relation between the channel coding and source coding problems with side information was analyzed. In the channel coding problem, the maximal probability of decoding error is the performance measure for any coding scheme. A class of deterministic maximal binning schemes were constructed for the duality relation. The constructed binning structure can be used in both of the side information coding problem with a common rate I(U; X)-I(U; S).
| Original language | English (US) |
|---|---|
| Pages (from-to) | 197 |
| Number of pages | 1 |
| Journal | IEEE International Symposium on Information Theory - Proceedings |
| State | Published - 2004 |
| Externally published | Yes |
| Event | Proceedings - 2004 IEEE International Symposium on Information Theory - Chicago, IL, United States Duration: Jun 27 2004 → Jul 2 2004 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Information Systems
- Modeling and Simulation
- Applied Mathematics