- 594 Downloads
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.
KeywordsMarkov Chain Bayesian Network Elemental Form Linear Programming Problem Secret Sharing
Unable to display preview. Download preview PDF.