Abstract
Elias and Fano independently proposed a quasi-succinct representation for monotonic integer sequences. In case the standard deviation is high, we suggest using the well known Cγ code instead of the Unary code used by their solution. In case the integers are similar, not necessarily forming a monotonic sequence, we propose to apply the Haar transform as a preprocessing stage, to achieve additional savings. Experimental results support the additional savings carried out by using our method.
Original language | English |
---|---|
Title of host publication | Proceedings of the Prague Stringology Conference 2020, PSC 2020 |
Editors | Jan Holub, Jan Zd'arek |
Publisher | Prague Stringology Club |
Pages | 1-10 |
Number of pages | 10 |
ISBN (Electronic) | 9788001067499 |
State | Published - 2020 |
Event | 2020 Prague Stringology Conference, PSC 2020 - Hybrid, Prague, Czech Republic Duration: 31 Aug 2020 → 2 Sep 2020 |
Publication series
Name | Proceedings of the Prague Stringology Conference 2020, PSC 2020 |
---|
Conference
Conference | 2020 Prague Stringology Conference, PSC 2020 |
---|---|
Country/Territory | Czech Republic |
City | Hybrid, Prague |
Period | 31/08/20 → 2/09/20 |
Bibliographical note
Publisher Copyright:© PSC 2020.All rights reserved.
Keywords
- lossless compression
- the Haar transform
- universal codes