多定界符变长可裂码
Variable-length Splittable Codes with Multiple Delimiters
摘要:
变长可裂码是从有序整数对的编码序列中推导出来的,其中一个整数对的分量的上界是某个常数,另一个是任何正整数。每一对是通过应用于一对的对应分量的两个固定独立前缀编码函数的级联来编码的。这种对序列的码字由相应对的编码的顺序级联组成。我们称这种代码为可分裂的。我们表明,斐波那契代码的高阶和代码的形式011多个分隔符. 10是分裂的。证明了多码的完备性和普适性。本文详细讨论了整数的多重编码问题。对于这些码,构造了一种快速字节对齐译码算法。比较了Fibonacci码和不同的多重Fibonacci码的压缩性能。由于多重码具有许多有用的性质,所以它优于Fibonacci码。
英文摘要:
Variable-length splittable codes are derived from encoding sequences of ordered integer pairs, where one of the pair's components is upper bounded by some constant, and the other one is any positive integer. Each pair is encoded by the concatenation of two fixed independent prefix encoding functions applied to the corresponding components of a pair. The codeword of such a sequence of pairs consists of the sequential concatenation of corresponding pair's encodings. We call such codes splittable. We show that Fibonacci codes of higher orders and codes with multiple delimiters of the form 011...10 are splittable. Completeness and universality of multi-delimiter codes are proved. Encoding of integers by multi-delimiter codes is considered in detail. For these codes, a fast byte aligned decoding algorithm is constructed. The comparative compression performance of Fibonacci codes and different multi-delimiter codes is presented. By many useful properties, multi-delimiter codes are superior to Fibonacci codes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。