Individually Optimal Single- And Multiple-Tree Almost Instantaneous Variable-To-Fixed Codes
2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT)(2018)
摘要
Variable-to-fixed (VF) codes are often based on dictionaries that obey the prefix-free property; e.g., the Tunstall codes. However, correct VF codes need not be prefix free. Removing that constraint may offer the opportunity to build more efficient codes. Here, we come back to the almost instantaneous VF codes introduced by Yamamoto and Yokoo. They considered both single trees and multiple trees to perform the parsing of the source string. We show that, in some cases, their technique builds suboptimal codes. We propose correctives accordingly. We also propose a new, completely different technique based on dynamic programming that builds individually optimal dictionary trees.
更多查看译文
关键词
prefix-free property,Tunstall codes,correct VF codes,instantaneous VF codes,suboptimal codes,individually optimal dictionary trees,optimal single-tree almost instantaneous variable-to-fixed codes,multiple-tree almost instantaneous variable-to-fixed codes,source strings,dynamic programming
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要