Two constructions on limits of entropy functions

IEEE Transactions on Information Theory

Volumn 53, Issue 1, 2007, Pages 320-330

  Matúš, František ^a  

^a INSTITUTE OF INFORMATION THEORY AND AUTOMATION   (Czech Republic)

Author keywords

Almost affine code; Coloring; Entropy function; Equipartition; Ideal secret sharing; Information inequalities; Information rate; Matroid; Partition representation; Polymatroid

Indexed keywords

COLORING; CONVOLUTION; ENTROPY; INFORMATION THEORY; MATRIX ALGEBRA; VECTORS;

ALMOST AFFINE CODE; ENTROPY FUNCTION; EQUIPARTITION; IDEAL SECRET SHARING;

THERMODYNAMICS;

EID: 33846088151     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2006.887090     Document Type: Article

References (59)

1. R. Ahlswede and I. Csiszár, "Common randomness in information theory and cryptography - Part II: CR capacity," IEEE Trans. Inf. Theory, vol. 44, no. 1, pp. 225-240, Jan. 1998.
2. A. Beimel and B. Chor, "Universally ideal secret-sharing schemes," IEEE Trans. Inf. Theory, vol. 40, no. 3, pp. 786-794, May 1994, Preliminary version in CRYPTO'92 - Proc. Advances in Cryptology (Lecture Notes in Computer Science). Berlin, Germany:SPringer-Verlag, 1993, vol. 740, pp. 183-195.
3. J. Benaloh and J. Leichter, "Generalized secret sharing and monotone functions," in CRYPTO'88: - Proc. on Advances in Cryptology (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1989, vol. 403, pp. 27-35.
4. G. Bennett, "Probability inequalities for the sum of independent random variables," J. Amer. Statist. Assoc., vol. 57, pp. 33-45, 1962.
5. G. R. Blakley and G. A. Kabatianski, "General perfect secret sharing schemes," in CRYPTO'95: 15th Annual International Cryptology Conf.. Berlin, Germany: Springer-Verlag, 1995, vol. 963, pp. 367-371.
6. G. R. Blakley and G. A. Kabatianski, "Generalized ideal secret-sharing schemes and matroids," Probl. Inf. Transm., vol. 33, pp. 277-284, 1997.
7. E. F. Brickell and D. M. Davenport, "On the classification of ideal secret-sharing schemes," J. Cryptol., vol. 4, pp. 123-134, 1991.
8. T. Brylawski, "Constructions," in Theory of Matroids, N. White, Ed. Cambridge, U.K.: Cambridge Univ. Press, 1986, pp. 2127-223.
9. T. H. Chan and R. W. Yeung, "On a relation between information inequalities and group theory," IEEE Trans. Inf. Theory, vol. 48, no. 7, pp. 1992-1995, Jul. 2002.
10. L. Csirmaz, "The dealer's random bits in perfect secret-sharing schemes," Studia Scient. Math. Hung., vol. 32, pp. 429-437, 1996.
11. L. Csirmaz, "The size of a share must be large," J. Cryptol., vol. 10, pp. 223-231, 1997.
12. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. Budapest: Akademiai Kiadó, 1981.
13. I. Csiszár and P. Narayan, "Secrecy capacities for multiple terminals," IEEE Trans. Inf. Theory, vol. 50, no. 12, pp. 3047-3061, Dec. 2004.
14. L. Devroye, L. Györfi, and G. Lugosi, A Probabilistic Theory of Pattern Recognition. New York: Springer-Verlag, 1996.
15. 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.
16. S. Fujishige, "Polymatroidal dependence structure of a set of random variables," Inf. Contr., vol. 39, pp. 55-72, 1978.
17. S. Fujishige, Submodular Functions and Optimization. Amsterdam, The Netherlands: North-Holland, 1991.
18. J. Dj. Golic, "On matroid characterization of ideal secret sharing schemes," J. Cryptol., vol. 11, pp. 75-86, 1998.
19. V. P. Grishukin, "On the extremality of the rank function of a connected semimodular lattice," Trans. AMS, vol. 158, pp. 31-36, 1994.
20. D. Hammer, A. Romashchenko, A. Shen, and N. Vereshchagin, "Inequalities for Shannon entropy and Kolmogorov complexity," J. Comput. Syst. Sci., vol. 60, pp. 442-464, 2000.
21. T. S. Han, "A uniqueness of Shannon's information distance and related nonnegativity problems," J. Comb. Inf. Syst. Sci., vol. 4, pp. 320-331, 1981.
22. T. Helgason, "Aspects of the theory of hypermatroids," in Hypergraph Seminar (Lecture Notes in Mathematics), C. Berge and D. Ray-Chaudhuri, Eds. Berlin, Germany: Springer-Verlag, 1974, vol. 411, pp. 191-214.
23. A. W. Ingleton, "Conditions for representability and transversality of matroids," in Proc. Fr. Br. Conf. 1970, Berlin, 1971, vol. 211, pp. 62-67, Springer-Verlag, Springer Lecture Notes.
24. A. W. Ingleton, "Representation of matroids," in Combinatorial Mathematics and its Applications, D. J. A.Welsh, Ed. London, U.K.: Academic, 1971, pp. 149-169.
25. M. Ito, A. Saito, and T. Nishizeki, "Secret sharing schemes realizing general access structure," in Proc. IEEE Global Telecommunication Conf., Globecom'87, 1987, pp. 99-102.
26. W.-A. Jackson and K. M. Martin, "Perfect secret sharing schemes on five participants," Des., Codes Cryptogr., vol. 9, pp. 267-286, 1996.
27. W.-A. Jackson and K. M. Martin, "Combinatorial models for perfect secret-sharing schemes," J. Comb. Math. Comb. Comput., vol. 28, pp. 249-265, 1998.
28. W.-A. Jackson, K. M. Martin, and Ch. M. Keefe, "Geometrical contributions to secret sharing theory," J. Geometry, vol. 79, pp. 102-133, 2004.
29. R. Lněnička, "On the tightness of the Zhang-Yeung inequality for gaussian vectors," Commun. Inf. and Syst., vol. 3, pp. 41-46, 2003.
30. L. Lovász, "Submodular functions and convexity," in Mathematical Programming - The State of the Art, A. Bachem, M. Grötchel, and B. Korte, Eds. Berlin: Springer-Verlag, 1982, pp. 234-257.
31. K. Makarychev, Yu. Makarychev, A. Romashchenko, and N. Vereshchagin, "A new class of non-Shannon type inequalities for entropies," Commun. Inf. and Syst., vol. 2, pp. 147-166, 2002.
32. J. Martí-Farré and C. Padró, "Secret sharing schemes with three or four minimal qualified subsets," Des., Codes Cryptogr., vol. 34, pp. 17-34, 2005.
33. F. Matúš, "Probabilistic conditional independence structures and matroid theory: Background," Int. J. Gen. Syst., vol. 22, pp. 185-196, 1994, (Preliminary version in WUPES'91 - Proc. Workshop on Uncertainty Processing in Expert Systems, Institute of Information Theory and Automation, Prague, Czech Republic, 1991, 12pp.).
34. F. Matúš, "Extreme convex set functions with many nonnegative differences," Discr. Math., vol. 135, pp. 177-191, 1994.
35. F. Matúš and M. Studený, "Conditional independences among four random variables I," Comb., Probab. and Comput., vol. 4, pp. 269-278, 1995.
36. F. Matúš, "Conditional independences among four random variables II," Comb., Probab. and Comput., vol. 4, pp. 407-417, 1995.
37. F. Matúš, "Conditional independences among four random variables III: Final conclusion," Comb., Probab. and Comput., vol. 8, pp. 269-276, 1999.
38. F. Matúš, "Matroid representations by partitions," Discr. Math., vol. 203, pp. 169-194, 1999.
39. F. Matúš, "Excluded minors for Boolean polymatroids," Discr. Math., vol. 235, pp. 317-321, 2001.
40. 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.
41. F. Matúš, "Piecewise linear conditional information inequality," IEEE Trans. Inf. Theory, vol. 44, no. 1, pp. 236-238, Jan. 2006.
42. F. Matúš, "Adhesivity of polymatroids," Discr. Math., accepted for publication.
43. C. J. H. McDiarmid, "Rado's theorem for polymatroids," Math. Proc. Cambridge Phil. Soc., vol. 78, pp. 263-281, 1975.
44. H. Narayan, Submodular Functions and Electrical Networks. Amsterdam, The Netherlands: Elsevier, 1997.
45. S.-L. Ng, "A representation of a family of secret sharing matroids," Des., Codes Cryptogr., vol. 30, pp. 5-19, 2003.
46. H. Q. Nguyen, "Semimodular functions and combinatorial geometries," Trans. AMS, vol. 238, pp. 355-383, 1978.
47. H. Q. Nguyen, "Semimodular functions," in Theory of Matroids, N. White, Ed. Cambridge, U.K.: Cambridge Univ. Press, 1986, pp. 272-297.
48. J. G. Oxley, Matroid Theory. Oxford, U.K.: Oxford Univ. Press, 1992.
49. R. T. Rockafellar, Convex Analysis. Princeton, NJ: Princeton Univ. Press, 1970.
50. P. D. Seymour, "On secret-sharing matroids," J. Comb. Theory B, vol. 56, pp. 69-73, 1992.
51. J. Simonis and A. Ashikhmin, "Almost affine codes," Des., Codes Cryptogr., vol. 14, pp. 179-197, 1998.
52. S. Smale and D.-X. Zhou, "Shannon sampling and function reconstruction from point values," Bull. AMS, vol. 41, pp. 279-305, 2004.
53. M. Studený, personal communication, 1990.
54. D. J. A. Welsh, Matroid Theory. London, U.K.: Academic, 1976.
55. R. W. Yeung, A First Course in Information Theory. New York: Kluwer Academic/Plenum, 2002.
56. R. W. Yeung, "A class of non-Shannon-type information inequalities and their applications," Commun. Inf. and Syst., vol. 1, pp. 87-100, 2001.
57. Z. Zhang and R. W. Yeung, "A non-Shannon-type conditional inequality of information quantities," IEEE Trans. Inf. Theory, vol. 43, no. 6, pp. 1982-1986, Nov. 1997.
58. Z. Zhang, "On a new non-Shannontype information inequality," Commun. Inf. and Syst., vol. 3, pp. 47-60, 2003.
59. Z. Zhang and R. W. Yeung, "On characterization of entropy function via information inequalities," IEEE Trans. Inf. Theory, vol. 44, no. 4, pp. 1440-1452, Jul. 1998.