作者: Da-gang Tian , Yi-qun Huang
DOI: 10.1155/2012/318946
关键词:
摘要: 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 compute the per unit cost proposed. same view suited maximum entropy. All polynomial time.