• DocumentCode
    3049409
  • Title

    On the hardness of finding optimal multiple preset dictionaries

  • Author

    Mitzenmacher, Michael

  • Author_Institution
    Div. of Eng. & Appl. Sci., Harvard Univ., Cambridge, MA, USA
  • fYear
    2001
  • fDate
    2001
  • Firstpage
    411
  • Lastpage
    418
  • Abstract
    Preset dictionaries for Huffman codes are used effectively in fax transmission and JPEG encoding. A natural extension is to allow multiple preset dictionaries instead of just one. We show, however, that finding optimal multiple preset dictionaries for Huffman and LZ77-based compression schemes is NP-hard
  • Keywords
    Huffman codes; computational complexity; data compression; facsimile; optimisation; Huffman codes; Huffman-based compression; JPEG encoding; LZ77-based compression; NP-hard problem; catalog segmentation; fax transmission; optimal multiple preset dictionaries; Code standards; Computational efficiency; Costs; Decoding; Dictionaries; Encoding; Engineering profession; Huffman coding; Marketing and sales; Transform coding;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Data Compression Conference, 2001. Proceedings. DCC 2001.
  • Conference_Location
    Snowbird, UT
  • ISSN
    1068-0314
  • Print_ISBN
    0-7695-1031-0
  • Type

    conf

  • DOI
    10.1109/DCC.2001.917172
  • Filename
    917172
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3049409