摘要: The capacity of uniform hypergraphs can be defined as a natural generalization the Shannon graphs. Corresponding to every hypergraph there is discrete memoryless channel in which zero error capacity, case smallest list size for it positive, equals hypergraph, and vice versa. Also, problem perfect hashing considered problem. Upper bounds are derived hypergraphs, using technique developed earlier based on concepts graph entropy entropy. These subadditive functionals probabilistic graphs (i.e. within probability distribution given their vertex sets). A modified version this given, replacing by another functional This refinement Lovasz's delta -functional. >
core.ac.uk
sci-hub.se 参考文章(7)
Jénos Körner, Fredman-Kolmo´s bounds and information theory Siam Journal on Algebraic and Discrete Methods. ,vol. 7, pp. 560- 570 ,(1986) , 10.1137/0607062
W. Haemers, On Some Problems of Lovász Concerning the Shannon Capacity of a Graph IEEE Transactions on Information Theory. ,vol. 25, pp. 231- 232 ,(1979) , 10.1109/TIT.1979.1056027
Michael L. Fredman, János Komlós, On the Size of Separating Systems and Families of Perfect Hash Functions Siam Journal on Algebraic and Discrete Methods. ,vol. 5, pp. 61- 68 ,(1984) , 10.1137/0605009
J. Korner, K. Marton, New Bounds for Perfect Hashing via Information Theory European Journal of Combinatorics. ,vol. 9, pp. 523- 530 ,(1988) , 10.1016/S0195-6698(88)80048-9
L. Lovasz, On the Shannon capacity of a graph IEEE Transactions on Information Theory. ,vol. 25, pp. 1- 7 ,(1979) , 10.1109/TIT.1979.1055985
C. Shannon, The zero error capacity of a noisy channel IEEE Transactions on Information Theory. ,vol. 2, pp. 8- 19 ,(1956) , 10.1109/TIT.1956.1056798
Imre Csiszár, Information theory ,(1981)