|
This article is cited in 1 scientific paper (total in 1 paper)
Hardware, software and distributed supercomputer systems
Vbinary: variable length integer coding revisited
Yu. V. Shevchuk Ailamazyan Program Systems Institute of Russian Academy of Sciences
Abstract:
The article introduces Vbinary, a parametrized variable-length prefix
integer coding. The coding is considered by means of examples in comparison
with existing codings, including Golomb/Rice and Elias codings. A naming
schema is proposed that allows to specify the coding parameters concisely.
Vbinary conding uses unusual n-ary extension technique which makes the coding
versatile, usable for both bit-based and byte-based data streams. By varying
parameters, Vbinary coding can be made efficient for small numbers or large
numbers, tailored to specific data distribution, tuned for efficient encoding and
decoding. Potential uses for the coding are network protocols, on-disk and
in-memory data representation, and final stages of data compression algorithms. (In English).
Key words and phrases:
coding of integers, variable length coding, prefix code, parametrized
coding, data compression.
Received: 09.11.2018 Accepted: 30.11.2018
Citation:
Yu. V. Shevchuk, “Vbinary: variable length integer coding revisited”, Program Systems: Theory and Applications, 9:4 (2018), 239–252
Linking options:
https://www.mathnet.ru/eng/ps311 https://www.mathnet.ru/eng/ps/v9/i4/p239
|
Statistics & downloads: |
Abstract page: | 131 | Full-text PDF : | 50 | References: | 15 |
|