Search
Abstract
Compression schemes for advanced data structures have become the challenge of today. Information theory has traditionally dealt with conventional data such as text, image, or video. In contrast, most data available today is multitype and context-dependent. To meet this challenge, we have recently initiated a systematic study of advanced data structures such as unlabeled graphs [1]. In this paper, we continue this program by considering trees with statistically correlated vertex names. Trees come in many forms, but here we deal with binary plane trees (where order of subtrees matters) and their non-plane version. Furthermore, we assume that each symbol of a vertex name depends in a Markovian sense on the corresponding symbol of the parent vertex name. We first evaluate the entropy for both types of trees. Then we propose two compression schemes COMPRESSPTREE for plane trees with correlated names, and COMPRESSNPTREE for non-plane trees. We prove that the former scheme achieves the lower bound within two bits, while the latter is within 1% of the optimal compression.
Citations
-
5
CrossRef
-
0
Web of Science
-
6
Scopus
Authors (3)
Cite as
Full text
full text is not available in portal
Keywords
Details
- Category:
- Conference activity
- Type:
- publikacja w wydawnictwie zbiorowym recenzowanym (także w materiałach konferencyjnych)
- Title of issue:
- 2016 IEEE International Symposium on Information Theory strony 1 - 5
- ISSN:
- 2157-8117
- Language:
- English
- Publication year:
- 2016
- Bibliographic description:
- Manager A., Turowski K., Szpankowski W.: Lossless Compression of Binary Trees with Correlated Vertex Names // 2016 IEEE International Symposium on Information Theory / Barcelona: Information Theory (ISIT) 2016 IEEE International Symposoum on, 2016, s.1-5
- DOI:
- Digital Object Identifier (open in new tab) 10.1109/isit.2016.7541492
- Verified by:
- Gdańsk University of Technology
seen 132 times
Recommended for you
Detecting coupling directions with transcript mutual information: A comparative study
- J. Amigó,
- B. Graff,
- G. Graff
- + 2 authors
Computing algebraic transfer entropy and coupling directions via transcripts
- J. Amigó,
- R. Monetti,
- B. Graff
- + 1 authors