Computation of Channel Capacity Based on Self-Concordant Functions
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.
2007 ◽
Vol 40
(27)
◽
pp. 7441-7450
◽
2005 ◽
Vol 128
(3)
◽
pp. 584-591
◽
Keyword(s):
1987 ◽
Vol 109
(3)
◽
pp. 366-371
◽
1990 ◽
Vol 36
(5)
◽
pp. 1019-1030
◽
1969 ◽
Vol 59
(2)
◽
pp. 157
◽
2011 ◽
Vol 403-408
◽
pp. 3140-3143
1954 ◽
Vol 101
(70)
◽
pp. 76-76
Keyword(s):
2003 ◽
Vol 36
(3)
◽
pp. 631-641
◽