Entropy and Optimal Compression of Some General Plane Trees

DOI10.1145/3275444zbMath1454.68047OpenAlexW2895506925MaRDI QIDQ4629973

Wojciech Szpankowski, Abram Magner, Zbigniew Gołȩbiewski

Publication date: 28 March 2019

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3275444

zbMATH Keywords

arithmetic codingrandom treesplane recursive trees

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05)

Related Items (2)

Compaction for two models of logarithmic‐depth trees: Analysis and experiments ⋮ Compression of dynamic graphs generated by a duplication model

This page was built for publication: Entropy and Optimal Compression of Some General Plane Trees