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

Aharon Ben-Tal; Marc Teboulle

doi:10.1007/BF01448363

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 journal › Article › peer-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 language	English
Pages (from-to)	121-132
Number of pages	12
Journal	Applied Mathematics and Optimization
Volume	17
Issue number	1
DOIs	https://doi.org/10.1007/BF01448363
State	Published - Jan 1988
Externally published	Yes

Access to Document

10.1007/BF01448363

Cite this

@article{0126daac5ba54b008fc9640806231c5e,

title = "Extension of some results for channel capacity using a generalized information measure",

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].",

author = "Aharon Ben-Tal and Marc Teboulle",

year = "1988",

month = jan,

doi = "10.1007/BF01448363",

language = "אנגלית",

volume = "17",

pages = "121--132",

journal = "Applied Mathematics and Optimization",

issn = "0095-4616",

publisher = "Springer New York",

number = "1",

}

TY - JOUR

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

AU - Ben-Tal, Aharon

AU - Teboulle, Marc

PY - 1988/1

Y1 - 1988/1

N2 - 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].

AB - 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].

UR - http://www.scopus.com/inward/record.url?scp=34250087351&partnerID=8YFLogxK

U2 - 10.1007/BF01448363

DO - 10.1007/BF01448363

M3 - מאמר

AN - SCOPUS:34250087351

VL - 17

SP - 121

EP - 132

JO - Applied Mathematics and Optimization

JF - Applied Mathematics and Optimization

SN - 0095-4616

IS - 1

ER -

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

Abstract

Access to Document

Other files and links

Fingerprint

Cite this