Computation of channel capacity based on self-concordant functions (Q415822)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6031996
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computation of channel capacity based on self-concordant functions |
scientific article; zbMATH DE number 6031996 |
Statements
Computation of channel capacity based on self-concordant functions (English)
0 references
9 May 2012
0 references
Summary: The computation of channel capacity is a classical issue in information theory. We prove that algorithms based on self-concordant functions can be used to deal with such issues, especially when constrains are included. A new algorithm to compute the channel capacity per unit cost is proposed. The same view is suited to the computation of maximum entropy. All the algorithms are of polynomial time.
0 references
channel capacity
0 references
information theory
0 references
self-concordant functions
0 references
convex optimization
0 references
0 references
0.9725964665412904
0 references
0.7577900886535645
0 references
0.756147027015686
0 references
