Now showing items 1-2 of 2
Efficient and Compact Representations of Some Non-canonical Prefix-Free Codes
[Abstract] For many kinds of prefix-free codes there are efficient and compact alternatives to the traditional tree-based representation. Since these put the codes into canonical form, however, they can only be used when ...
Grammar compressed sequences with rank/select support
(Elsevier BV, 2016-10-14)
[Abstract] Sequence representations supporting not only direct access to their symbols, but also rank/select operations, are a fundamental building block in many compressed data structures. Several recent applications need ...