An Information-Theoretic Approach to Algorithms
暂无分享,去创建一个
A quite general result, called the Leaf Entropy Theorem, is proved. This theorem gives the relation between the entropy of the leave and the branching entropies of the nodes in a rooted tree with probabilities. It is shown that this theorem can be used to bound the average number of essential tests performed by a testing algorithm for a discrete random variable. The approach is illustrated by two examples, namely, the sorting of a list and the polling of the stations in a multiple-access communications system.
[1] Jack K. Wolf,et al. Principles of Group Testing and an Application to the Design and Analysis of Multi-Access Protocols , 1985 .
[2] Amiel Feinstein,et al. Transmission of Information. , 1962 .
[3] Pramod K. Varshney,et al. Application of information theory to the construction of efficient decision trees , 1982, IEEE Trans. Inf. Theory.