Fused trees and some new approaches to source coding
- 1 May 1988
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 34 (3) , 417-424
- https://doi.org/10.1109/18.6022
Abstract
The concept of fusion partition for the node set of a tree, and the concept of a fused tree corresponding to it, are discussed. A fused tree requires, in principle, significantly less memory for storage than the original tree yet allows the recovery of the original. Hence, it makes sense to store a tree in a fused form. Furthermore, if labels from an ordered set C are assigned to the branches of the original tree so that a lexographic (alphabetic) order on the set of terminal nodes is induced, a fused tree still enables the execution of direct and inverse enumeration algorithms. A fusion algorithm to produce the completely fused tree for a given tree is presented. Some approaches to data compression problems related to the algorithms given are discussedKeywords
This publication has 12 references indexed in Scilit:
- Universal coding, information, prediction, and estimationIEEE Transactions on Information Theory, 1984
- A universal data compression systemIEEE Transactions on Information Theory, 1983
- Universal modeling and codingIEEE Transactions on Information Theory, 1981
- Linear Algorithm for Data Compression via String MatchingJournal of the ACM, 1981
- Compression of individual sequences via variable-rate codingIEEE Transactions on Information Theory, 1978
- Universal noiseless codingIEEE Transactions on Information Theory, 1973
- Enumerative source encodingIEEE Transactions on Information Theory, 1973
- On variable-length-to-block codingIEEE Transactions on Information Theory, 1972
- Variable-Length Binary EncodingsBell System Technical Journal, 1959
- Two inequalities implied by unique decipherabilityIEEE Transactions on Information Theory, 1956