We present a novel method to recycle bits of paletted data sets. We exploit that the codebook of such data can be reordered without affecting the content. Enumerating all possible permutations of N codebook entries yields an additional O(N log2 N) bits that can be used without storage overhed for the losless encoding of a limited amount of tags, meta-information, or part of the actual data. © 2011 IEEE.
|Original language||English (US)|
|Title of host publication||2011 Data Compression Conference|
|Publisher||Institute of Electrical and Electronics Engineers (IEEE)|
|State||Published - Mar 2011|