Referenced Items are not available for this document.
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 overhead-for the lossless encoding of a limited amount of tags, meta-information, or part of the actual data.
Published in:
Data Compression Conference (DCC), 2011
Date of Conference: 29-31 March 2011
- Page(s):
- 475
- ISSN :
- 1068-0314
- Print ISBN:
- 978-1-61284-279-0
- INSPEC Accession Number:
- 11933144
- Conference Location :
- Snowbird, UT
- Digital Object Identifier :
- 10.1109/DCC.2011.79
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
