arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1605.01182cs.ITmath.IT
收藏

单个序列码长的经验累积量母函数

On empirical cumulant generating functions of code lengths for individual sequences

Neri Merhav

摘要:

从码长的最佳可实现经验累积量生成函数(CGF)的角度考虑使用有限状态(FS)机对单个序列进行无损压缩的问题,即,取幂码长的经验平均值的归一化对数。由于概率CGF在源的雷尼熵方面被最小化,因此本研究的动机之一是导出雷尼熵的个体序列模拟,以同样的方式,FS压缩性是香农熵的个体序列对应物。我们认为CGF的代码长度从固定到可变(F-V)长度编码的角度和可变到可变(V-V)长度编码的角度,其中后者原来产生更好的结果,符合FS压缩性。我们还扩展了我们的结果压缩边信息,可在编码器和解码器。在这种情况下,V-V版本不再与FS压缩性一致,而是导致不同的复杂性度量。

英文摘要:

We consider the problem of lossless compression of individual sequences using finite-state (FS) machines, from the perspective of the best achievable empirical cumulant generating function (CGF) of the code length, i.e., the normalized logarithm of the empirical average of the exponentiated code length. Since the probabilistic CGF is minimized in terms of the Rényi entropy of the source, one of the motivations of this study is to derive an individual-sequence analogue of the Rényi entropy, in the same way that the FS compressibility is the individual-sequence counterpart of the Shannon entropy. We consider the CGF of the code-length both from the perspective of fixed-to-variable (F-V) length coding and the perspective of variable-to-variable (V-V) length coding, where the latter turns out to yield a better result, that coincides with the FS compressibility. We also extend our results to compression with side information, available at both the encoder and decoder. In this case, the V-V version no longer coincides with the FS compressibility, but results in a different complexity measure.

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

↑