Computation of channel capacity based on self-concordant functions (Q415822)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Computation of channel capacity based on self-concordant functions
scientific article

    Statements

    Computation of channel capacity based on self-concordant functions (English)
    0 references
    0 references
    0 references
    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
    0 references
    0 references
    0 references
    0 references
    channel capacity
    0 references
    information theory
    0 references
    self-concordant functions
    0 references
    convex optimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references