Shannon-Type Inequalities

  • Raymond W. Yeung
Part of the Information Technology: Transmission, Processing and Storage book series (PSTE)


The basic inequalities form the most important set of information inequalities. In fact, almost all the information inequalities known to date are implied by the basic inequalities. These are called Shannon-type inequalities. In this chapter, we show that verification of Shannon-type inequalities can be formulated as a linear programming problem, thus enabling machine-proving of all such inequalities.


Entropy Pyramid 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2002

Authors and Affiliations

  • Raymond W. Yeung
    • 1
  1. 1.The Chinese University of Hong KongHong Kong

Personalised recommendations