RUS  ENG
Full version
JOURNALS // Program Systems: Theory and Applications // Archive

Program Systems: Theory and Applications, 2018 Volume 9, Issue 4, Pages 477–491 (Mi ps324)

This article is cited 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 coding utilizes 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 Russian).

Key words and phrases: coding of integers, variable length coding, prefix code, parametrized coding, data compression.

UDC: 004.627
BBK: 32.973.1

Received: 09.11.2018
04.12.2018
Accepted: 30.12.2018

DOI: 10.25209/2079-3316-2018-9-4-477-491



© Steklov Math. Inst. of RAS, 2025