### Abstract

Memoryless communication channels with arbitrary alphabets where each input symbol is assigned a cost are considered. The maximum number of bits that can be transmitted reliably through the channel per unit cost is studied. It is shown that if the input alphabet contains a zero-cost symbol, then the capacity per unit cost admits a simple expression as the maximum normalized divergence between two conditional output distributions. The direct part of this coding theorem admits a constructive proof via Stein’s lemma on the asymptotic error probability of binary hypothesis tests. Single-user, multiple-access and interference channels are studied.

Original language | English (US) |
---|---|

Pages (from-to) | 1019-1030 |

Number of pages | 12 |

Journal | IEEE Transactions on Information Theory |

Volume | 36 |

Issue number | 5 |

DOIs | |

State | Published - Sep 1990 |

### All Science Journal Classification (ASJC) codes

- Information Systems
- Computer Science Applications
- Library and Information Sciences

## Fingerprint Dive into the research topics of 'On Channel Capacity per Unit Cost'. Together they form a unique fingerprint.

## Cite this

Verdu, S. (1990). On Channel Capacity per Unit Cost.

*IEEE Transactions on Information Theory*,*36*(5), 1019-1030. https://doi.org/10.1109/18.57201