Set Reordering for Paletted Data

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 log₂ N) bits that can be used-without storage overhead-for the lossless encoding of a limited amount of tags, meta-information, or part of the actual data.