Title :
Random access communication and graph entropy
Author :
Körner, J. ; Marton, K.
Author_Institution :
Math. Inst. of Hungarian Acad. of Sci., Budapest, Hungary
fDate :
3/1/1988 12:00:00 AM
Abstract :
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
Keywords :
entropy; graph theory; information theory; probability; conflict resolution; graph entropy; lower bounds; probabilistic problem; random-access communication; Entropy; Equations; Information theory; Multiaccess communication; Page description languages; Probability distribution; Random sequences; Random variables; Stochastic processes;
Journal_Title :
Information Theory, IEEE Transactions on
