.png){kind=icon}
返回
On improving Tunstall codes
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ipm.2011.01.005.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Though many compression methods are based on the use of variable length codes, there has recently been a trend to search for alternatives in which the lengths of the codewords are more restricted, which can have useful applications, such as easier processing and fast decoding. This paper explores the construction of variable-to-fixed length codes, which have been suggested long ago by Tunstall. Using new heuristics based on suffix trees, the performance of Tunstall codes can in some cases be improved by more than 40%. (C) 2011 Elsevier Ltd. All rights reserved.
Keyword:
Data compression
Huffman codes
Tunstall codes
Suffix trees
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
6.9
论文数:
5.2K
被引数:
1.4W
机构
引用论文
.png){kind=icon}
Reliability and construct validity of the Automated Neuropsychological Assessment Metrics (ANAM) mood scale自动神经心理学评估指标 (ANAM) 情绪量表的信度和结构效度
OAAI
OAAI分享收藏分享收藏分享收藏
查看更多内容