Efficient Integer Retrieving from Unordered Compressed Sequences
From MaRDI portal
Publication:6426210
arXiv2302.05869MaRDI QIDQ6426210
Author name not available (Why is that?)
Publication date: 12 February 2023
Abstract: 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.
Has companion code repository: https://github.com/zavadsky/directaccess
This page was built for publication: Efficient Integer Retrieving from Unordered Compressed Sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6426210)