Constructing optimal whole-bit recycling codes
Constructing optimal whole-bit recycling codes
复制标题
构建最佳的全位回收代码
DOI：
10.1109/itwnit.2009.5158535
复制
发表时间：
2009
期刊：
影响因子：
--
通讯作者：
V. Beaudoin
中科院分区：
文献类型：
--
作者：
Danny Dubé;V. Beaudoin
位回收的目的是提高压缩技术（例如 LZ77）所实现的速率，该技术因编码的多重性而导致冗余。位回收的性能主要取决于它使用的回收代码。之前的工作中已经提到了构建最佳回收代码的秘诀。然而，没有给出有效的算法和最优性证明。我们在这里介绍两者。
Bit recycling aims at improving the rates achieved by compression techniques, such as LZ77, that suffer from the redundancy caused by the multiplicity of the encodings. The performance of bit recycling depends crucially on the recycling codes that it uses. A recipe for the construction of optimal recycling codes has been mentioned in previous work. However, no efficient algorithm and proof of optimality were given. We present both here.