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

无序压缩序列的高效检索

Efficient Integer Retrieving from Unordered Compressed Sequences

Igor O. Zavadskyi

摘要:

变长反向多重定界符(RMD)码是用来表示无界和无序整数序列的码。当应用于数据压缩时,它们结合了良好的压缩比和快速解码。本文研究了RMD码的另一个性质--直接存取码字的能力。我们提出的方法,使我们能够提取和解码的码字从RMD-比特流在几乎恒定的时间与微小的空间开销,并进行实验,其应用于自然语言文本压缩。

英文摘要:

The variable-length Reverse Multi-Delimiter (RMD) codes are known to represent sequences of unbounded and unordered integers. When applied to data compression, they combine a good compression ratio with fast decoding. In this paper, we investigate another property of RMD-codes - the ability of direct access to codewords in the encoded bitstream. We present the method allowing us to extract and decode a codeword from an RMD-bitstream in almost constant time with the tiny space overhead, and make experiments on its application to natural language text compression.

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

↑