Computation of channel capacity based on self-concordant functions
From MaRDI portal
Publication:415822
DOI10.1155/2012/318946zbMath1237.94040OpenAlexW1966013066WikidataQ58908502 ScholiaQ58908502MaRDI QIDQ415822
Publication date: 9 May 2012
Published in: Journal of Electrical and Computer Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2012/318946
Measures of information, entropy (94A17) Channel models (including quantum) in information and communication theory (94A40) Communication theory (94A05)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- A survey of results for deletion channels and related synchronization channels
- Extension of some results for channel capacity using a generalized information measure
- A Mathematical View of Interior-Point Methods in Convex Optimization
- A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
- Convex Polynomial Approximation in the Uniform Norm: Conclusion
- Optimal Portfolio Diversification Using the Maximum Entropy Principle
- Geometric Programming Duals of Channel Capacity and Rate Distortion
- An Algebraic, Analytic, and Algorithmic Investigation on the Capacity and Capacity-Achieving Input Probability Distributions of Finite-Input– Finite-Output Discrete Memoryless Channels
- On channel capacity per unit cost
- The capacity-cost function of discrete additive noise channels with and without feedback
- Coding for channels with cost constraints
- Adaptive Alternating Minimization Algorithms
- Squeezing the Arimoto–Blahut Algorithm for Faster Convergence
- An algorithm for computing the capacity of arbitrary discrete memoryless channels
- Computation of channel capacity and rate-distortion functions
- Generalized Iterative Scaling for Log-Linear Models
This page was built for publication: Computation of channel capacity based on self-concordant functions
