Referenced Items are not available for this document.
We show that the following simple compression problem is NP-hard: given a collection of documents, find the pair of Huffman dictionaries that minimizes the total compressed size of the collection, where the best dictionary from the pair is used to compress each document. We also show the NP-hardness of finding optimal multiple preset dictionaries for LZ'77-based compression schemes. Our reductions make use of the catalog segmentation problem, a natural partitioning problem. Our results justify heuristic attacks used in practice.
Published in:
Information Theory, IEEE Transactions on
(Volume:50
,
Issue:
7
)
Date of Publication: July 2004
- Page(s):
- 1536 - 1539
- ISSN :
- 0018-9448
- INSPEC Accession Number:
- 8011515
- Digital Object Identifier :
- 10.1109/TIT.2004.830778
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 21 June 2004
- Issue Date :
- July 2004
- Sponsored by :
- IEEE Information Theory Society
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.
