Random access communication and graph entropy
暂无分享，去创建一个
A probabilistic problem that arises for conflict resolution in random-access communication is treated. An earlier conjecture is disproved and a technique for finding lower bounds on the number of graphs of given structure needed to cover all edges of a given graph is developed. >
[1] B. Hajek. Ergodic Process Selection , 1987 .
[2] J. Komlos,et al. On the Size of Separating Systems and Families of Perfect Hash Functions , 1984 .
[3] N. J. A. Sloane,et al. Lexicographic codes: Error-correcting codes from game theory , 1986, IEEE Trans. Inf. Theory.
[4] J. Körner. Fredman-Kolmo´s bounds and information theory , 1986 .
[5] János Körner,et al. New Bounds for Perfect Hashing via Information Theory , 1988, Eur. J. Comb..