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

DOI10.1007/BF01448363zbMath0641.94008OpenAlexW2117770630MaRDI QIDQ1101061

Aharon Ben-Tal, Marc Teboulle

Publication date: 1988

Published in: Applied Mathematics and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01448363

zbMATH Keywords

dualityconvex programmingchannel capacityconcave programminggeneralized information measure

Mathematics Subject Classification ID

Convex programming (90C25) Measures of information, entropy (94A17) Channel models (including quantum) in information and communication theory (94A40)

Related Items

Computation of channel capacity based on self-concordant functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• Entropy differential metric, distance and divergence measures in probability spaces: A unified approach
• Measuring information beyond communication theory - why some generalized information measures may be useful, others not
• Methods of descent for nondifferentiable optimization
• Cross entropy, dissimilarity measures, and characterizations of quadratic entropy
• Rate distortion theory with generalized information measures via convex programming duality
• Two Linear Programming Algorithms for the Linear Discrete L 1 Norm Problem
• On the convexity of some divergence measures based on entropy functions
• On a method of calculating the capacity of a discrete memoryless channel
• On the computation of capacity of discrete memoryless channel
• On functionals satisfying a data-processing theorem
• On the capacity of a discrete, constant channel
• Convex Analysis
• An algorithm for computing the capacity of arbitrary discrete memoryless channels
• An Improved Algorithm for Discrete $l_1 $ Linear Approximation