A projection method for derivation of non-Shannon-type information inequalities

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2008, Pages 2116-2120

  Xu, Weidong ^a   Wang, Jia ^a   Sun, Jun ^a  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

INTERNATIONAL SYMPOSIUM; PROJECTION METHODS; TYPE INFORMATION;

INFORMATION THEORY; TECHNICAL PRESENTATIONS;

CYBERNETICS;

EID: 52349100491     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2008.4595363     Document Type: Conference Paper

References (17)

1. Z. Zhang and R. W. Yeung, "A non-Shannon-type conditional inequality of information quantities," IEEE Trans. Inform. Theory, vol. 43, no. 6, pp. 1982-1985, Nov. 1997.
2. Z. Zhang and R. W. Yeung, "On characterization of entropy function via information inequalities," IEEE Trans. Inform. Theory, vol. 44, no. 4, pp. 1440-1452, Jul. 1998.
3. K. Makarychev, Y. Makarychev, A. Romashchenko, and N. Vereshchagin, "A new class of non-Shannon-type inequalities for entropies," Commun. Inf. and Syst., vol. 2, no. 2, pp. 147-166, Dec. 2002.
4. Z. Zhang, "On a new non-Shannon type information inequality," Commun. Inf. and Syst., vol. 3, no. 1, pp. 47-60, June 2003.
5. R. Dougherty, C. Freiling, and K. Zeger, "Six new non-Shannon information inequalities," in Proc. IEEE Int. Symp. Information Theory, Seattle, WA, Jul. 2006, pp. 233-236.
6. F. Matúš, "Inequalities for Shannon entropies and adhesivity of polymatroids," in Proc. 9th Canadian Workshop on Information Theory, McGill University, Montréal, QC, Canada, 2005, pp. 28-31.
7. F. Matúš and M. Studený, "Conditional independences among four random variables I," Combinatorics, Probability and Computing, vol. 4, no. 4, pp. 269-278, 1995.
8. R. W. Yeung, "A framework for linear information inequalities," IEEE Trans. Inform. Theory, vol. 43, no. 6, pp. 1924-1934, Nov. 1997.
9. R. W. Yeung, A First Course in Information Theory. New York: Kluwer Academic/Plenum, 2002.
10. G. M. Ziegler, Lectures on Polytopes. Springer-Verlag, 1995.
11. T. Huynh, C. Lassez, and J-L. Lassez, "Practical issues on the projection of polyhedral sets," Annals of Mathematics and Artificial Intelligence, vol. 6, pp. 295-315, Nov. 1992.
12. B. Kaluzny, "Polyhedral computation: a survey of projection methods," Class Project, 2002.
13. C. Lassez and J-L. Lassez, "Quantifier elimination for conjunctions of linear constraints via a convex hull algorithm," Symbolic and Numerical Computation for Artificial Intelligence, Donald, Kapur, and Mundy Ed., Academic Press, 1993.
14. K. Fukuda and A. Prodon, "Double description method revisited," Combinatorics and Computer Science, vol. 1120 of LNCS. Springer-Verlag, pp. 91-111, 1996.
15. C. N. Jones, E. C. Kerrigan, and J. M. Maciejowski, "Equality Set Projection: A new algorithm for the projection of polytopes in halfspace representation," Technical Report CUED/F-INFENG/TR.463, 2004.
16. D. Avis, D. Bremner, and R. Seidel, "How good are convex hull algorithms?" Computational Geometry, vol. 7, no. 5, pp. 265-301, April 1997.
17. F. Matúš, "Infinitely many information inequalities," in Proc. IEEE Int. Symp. Information Theory, Nice, France, June 2007, pp. 41-44.