Computation of channel capacity based on self-concordant functions
DOI10.1155/2012/318946zbMATH Open1237.94040DBLPjournals/jece/TianH12OpenAlexW1966013066WikidataQ58908502 ScholiaQ58908502MaRDI QIDQ415822FDOQ415822
Authors: Da-Gang Tian, Yi-Qun Huang 
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
Recommendations
- Computations of channel capacity and maximum entropy based on self-concordant functions
- scientific article; zbMATH DE number 3956962
- scientific article; zbMATH DE number 4191549
- Generalised performance function for \((r,s)\) entropy of DMC under single and multiple constraints
- Extension of some results for channel capacity using a generalized information measure
Communication theory (94A05) Measures of information, entropy (94A17) Channel models (including quantum) in information and communication theory (94A40)
Cites Work
- A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new polynomial-time algorithm for linear programming
- Maximum entropy density estimation with generalized regularization and an application to species distribution modeling
- Generalized Iterative Scaling for Log-Linear Models
- A mathematical view of interior-point methods in convex optimization
- Optimal Portfolio Diversification Using the Maximum Entropy Principle
- Geometric Programming Duals of Channel Capacity and Rate Distortion
- An algorithm for computing the capacity of arbitrary discrete memoryless channels
- Computation of channel capacity and rate-distortion functions
- Information theory and network coding
- On channel capacity per unit cost
- Extension of some results for channel capacity using a generalized information measure
- Convex Polynomial Approximation in the Uniform Norm: Conclusion
- An Algebraic, Analytic, and Algorithmic Investigation on the Capacity and Capacity-Achieving Input Probability Distributions of Finite-Input– Finite-Output Discrete Memoryless Channels
- 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
- A survey of results for deletion channels and related synchronization channels
Cited In (9)
- Efficient Approximation of Channel Capacities
- Extension of some results for channel capacity using a generalized information measure
- Frank-Wolfe method used for solving channel capacity
- Title not available (Why is that?)
- Reverse EM-problem based on Bregman divergence and its application to classical and quantum information theory
- A practical method for approaching the channel capacity of constrained channels
- Generalised performance function for \((r,s)\) entropy of DMC under single and multiple constraints
- Computations of channel capacity and maximum entropy based on self-concordant functions
- Title not available (Why is that?)
Uses Software
This page was built for publication: Computation of channel capacity based on self-concordant functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q415822)
