Extension of some results for channel capacity using a generalized information measure

Aharon Ben-Tal*, Marc Teboulle

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

A new formulation for the channel capacity problem is derived by using the duality theory of convex programming. The simple nature of this dual representation is suitable for computational purposes. The results are derived in a unified way by formulating the channel capacity problem as a special case of a general class of concave programming problems involving a generalized information measure recently introduced by Burbea and Rao [10].

Original languageEnglish
Pages (from-to)121-132
Number of pages12
JournalApplied Mathematics and Optimization
Volume17
Issue number1
DOIs
StatePublished - Jan 1988
Externally publishedYes

Fingerprint

Dive into the research topics of 'Extension of some results for channel capacity using a generalized information measure'. Together they form a unique fingerprint.

Cite this