2000 character limit reached
Universal Tree Source Coding Using Grammar-Based Compression (1701.08785v1)
Published 21 Jan 2017 in cs.IT and math.IT
Abstract: We apply so-called tree straight-line programs to the problem of lossless compression of binary trees. We derive upper bound on the maximal pointwise redundancy (or worst-case redundancy) that improve previous bounds obtained by Zhang, Yang, and Kieffer using directed acyclic graphs. Using this, we obtain universal codes for new classes of structered tree sources.