A Universal Grammar-Based Code for Lossless Compression of Binary Trees
From MaRDI portal
Publication:2986464
DOI10.1109/TIT.2013.2295392zbMath1360.94138arXiv1304.7392MaRDI QIDQ2986464
Jie Zhang, Enhui Yang, John Cronan Kieffer
Publication date: 16 May 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.7392
Related Items (4)
Grammar-Based Tree Compression ⋮ Constructing small tree grammars and small circuits for formulas ⋮ Compression of dynamic graphs generated by a duplication model ⋮ Distinct fringe subtrees in random trees
This page was built for publication: A Universal Grammar-Based Code for Lossless Compression of Binary Trees