.png){kind=icon}
返回
Data compression using antidictionaries
.png){kind=icon}
OA
AI
DOI：10.1109/5.892711.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We give a new text-compression scheme based on forbidden words (antidictionary). We prove that our algorithms attain the entropy for balanced binary sources. They run in linear time. Moreover, one of the main advantages of this approach is that is produces very fast decompressors. A second advantage is a synchronization property that is helpful to search compressed data and allows parallel compression. The techniques used in this paper are form information theory and finite automata.
Keyword:
data compression
finite automaton
forbidden word
information theory
lossless compression
pattern matching
期刊
IF:
25.9
论文数:
9.9K
被引数:
4.5W
机构
暂无机构信息
引用论文
Structural Insights into Putative Molybdenum Cofactor Biosynthesis Protein C (MoaC2) from Mycobacterium tuberculosis H37Rv.png)
PLoS ONEOAAI
PLoS ONEIF0
OAAI分享收藏 没有更多内容
没有更多内容