arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1006.0284cs.ITmath.IT
收藏

反字典码的渐近最优性

Asymptotic Optimality of Antidictionary Codes

Takahiro Ota, Hiroyoshi Morita

摘要:

反字典码是一种使用反字典的无损压缩算法,反字典是一组不作为输入字符串中的子字符串出现的最小单词。该码是由Crochemore等人于2000年提出的,并且其渐近最优性已经被证明仅关于特定的信息源,称为平衡二进制源,其是二进制马尔可夫源,其中状态转移以1/2或1的概率发生。在本文中,我们证明了静态和动态反字典码的最优性关于一个平稳遍历马尔可夫源有限字母表,使一个状态转移发生的概率$p (0 < p \leq 1)$。

英文摘要:

An antidictionary code is a lossless compression algorithm using an antidictionary which is a set of minimal words that do not occur as substrings in an input string. The code was proposed by Crochemore et al. in 2000, and its asymptotic optimality has been proved with respect to only a specific information source, called balanced binary source that is a binary Markov source in which a state transition occurs with probability 1/2 or 1. In this paper, we prove the optimality of both static and dynamic antidictionary codes with respect to a stationary ergodic Markov source on finite alphabet such that a state transition occurs with probability $p (0 < p \leq 1)$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑