Extension of some results for channel capacity using a generalized information measure
type: Item
instance of: scholarly article
title: Extension of some results for channel capacity using a generalized information measure
zbMATH Open document ID: 0641.94008
DOI: 10.1007/BF01448363
author: Aharon Ben-Tal
author: Marc Teboulle
published in: Applied Mathematics and Optimization
publication date: 1988-01-01T00:00:00Z
review text: The authors present a new formulation, based on the duality theory for convex programming, for the channel capacity problem. The natural structure of this dual representation is suitable for recent numerical schemes in the mathematical programming literature, and is quite useful for computational purposes and the derivation of bounds. The results are derived in a unified manner by formulating the channel capacity problems as a particular case of a general class of concave programming problems involving a generalized information measure introduced recently by the reviewer and \textit{C. R. Rao} [IEEE Trans. Inf. Theory IT-28, 489-495 (1982; Zbl 0479.94009)]. The results also show that this new information measure of Burbea and Rao can be successfully used to develop a generalized channel capacity theory.
reviewed by: Jacob Burbea
Mathematics Subject Classification ID: 94A40
Mathematics Subject Classification ID: 94A17
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 4045630
zbMATH Keywords: duality
zbMATH Keywords: convex programming
zbMATH Keywords: channel capacity
zbMATH Keywords: concave programming
zbMATH Keywords: generalized information measure
MaRDI profile type: Publication
cites work: Measuring information beyond communication theory - why some generalized information measures may be useful, others not
cites work: An algorithm for computing the capacity of arbitrary discrete memoryless channels
cites work: Q4141092
cites work: Two Linear Programming Algorithms for the Linear Discrete L 1 Norm Problem
cites work: An Improved Algorithm for Discrete $l_1 $ Linear Approximation
cites work: Rate distortion theory with generalized information measures via convex programming duality
cites work: Q3339004
cites work: On the convexity of some divergence measures based on entropy functions
cites work: Entropy differential metric, distance and divergence measures in probability spaces: A unified approach
cites work: On the computation of capacity of discrete memoryless channel
cites work: Q5539510
cites work: Q5595624
cites work: Q5563189
cites work: Methods of descent for nondifferentiable optimization
cites work: Q4132264
cites work: Q3892853
cites work: On the capacity of a discrete, constant channel
cites work: Cross entropy, dissimilarity measures, and characterizations of quadratic entropy
cites work: Convex Analysis
cites work: Q4050397
cites work: A Mathematical Theory of Communication
cites work: On a method of calculating the capacity of a discrete memoryless channel
cites work: Q4146571
cites work: On functionals satisfying a data-processing theorem
full work available at URL: https://doi.org/10.1007/bf01448363
OpenAlex ID: W2117770630
description: scientific article; zbMATH DE number 4045630