Entropy Bounds for Grammar-Based Tree Compressors

Article Properties
Cite
Hucke, Danny, et al. “Entropy Bounds for Grammar-Based Tree Compressors”. IEEE Transactions on Information Theory, vol. 67, no. 11, 2021, pp. 7596-15, https://doi.org/10.1109/tit.2021.3112676.
Hucke, D., Lohrey, M., & Benkner, L. S. (2021). Entropy Bounds for Grammar-Based Tree Compressors. IEEE Transactions on Information Theory, 67(11), 7596-7615. https://doi.org/10.1109/tit.2021.3112676
Hucke D, Lohrey M, Benkner LS. Entropy Bounds for Grammar-Based Tree Compressors. IEEE Transactions on Information Theory. 2021;67(11):7596-615.
Journal Categories
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Science
Science (General)
Cybernetics
Information theory
Technology
Electrical engineering
Electronics
Nuclear engineering
Electric apparatus and materials
Electric circuits
Electric networks
Technology
Electrical engineering
Electronics
Nuclear engineering
Telecommunication
Technology
Technology (General)
Industrial engineering
Management engineering
Information technology
You May Also Like
Refrences
Title Journal Journal Categories Citations Publication Date
A comparison of empirical tree entropies 2020
Using statistical encoding to achieve tree succinctness never seen before 2020
Compression of unordered XML trees 2017
Universal sequential coding of single messages 1987
Entropy bounds for grammar compression 2018