A Universal Grammar-Based Code for Lossless Compression of Binary Trees
IEEE Transactions on Information Theory(2014)
摘要
We consider the problem of lossless compression of binary trees, with the aim of reducing the number of code bits needed to store or transmit such trees. A lossless grammar-based code is presented, which encodes each binary tree into a binary codeword in two steps. In the first step, the tree is transformed into a context-free grammar from which the tree can be reconstructed. In the second step, the context-free grammar is encoded into a binary codeword. The decoder of the grammar-based code decodes the original tree from its codeword by reversing the two encoding steps. It is shown that the resulting grammar-based binary tree compression code is a universal code on a family of probabilistic binary tree source models satisfying certain weak restrictions.
更多查看译文
关键词
probabilistic binary tree source models,tree codes,decoder,binary tree,universal code,lossless compression,grammar-based binary tree compression code,data compression,lossless grammar-based code,context-free grammar,context-free grammars,grammar-based code,minimal dag representation,binary trees,binary codes,code bits,universal grammar-based code,binary codeword,decoding,labeling,production,encoding,grammar based code,indexes,context free grammar,grammar,context free grammars
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络