On computation of information via variation and inequalities for the entropy function

  • Authors:
  • V. V. Prelov

  • Affiliations:
  • Kharkevich Institute for Information Transmission Problems, RAS, Moscow, Russia

  • Venue:
  • Problems of Information Transmission
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper supplements the author's paper [1]. We obtain an explicit formula which in a special case allows us to calculate the maximum of mutual information of several random variables via the variational distance between the joint distribution of these random variables and the product of their marginal distributions. We establish two new inequalities for the binary entropy function, which are related to the problem considered here.