A new geometric capacity characterization of a discrete memoryless channel

  • Authors:

  • K. Nakagawa;F. Kanaya

  • Affiliations:

  • NTT Lab., Kanagawa;-

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2006

Quantified Score

Hi-index 754.84

Visualization

Abstract

A novel geometrical characterization of the capacity of a discrete memoryless channel is proposed. It is based on Csiszar's theorem, which represents the capacity using the Kullback-Leibler discrimination information. A new geometrical capacity computing method is obtained