Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Yeung, R.W. (2002). Shannon-Type Inequalities. In: A First Course in Information Theory. Information Technology: Transmission, Processing and Storage. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-8608-5_13
Download citation
DOI: https://doi.org/10.1007/978-1-4419-8608-5_13
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-4645-6
Online ISBN: 978-1-4419-8608-5
eBook Packages: Springer Book Archive