• DocumentCode
    2936438
  • Title

    Lossless data compression techniques

  • Author

    Holtz, Klaus ; Holtz, Eric

  • Author_Institution
    Omni Dimensional Networks, San Franscisco, CA, USA
  • fYear
    1994
  • fDate
    27-29 Sep 1994
  • Firstpage
    392
  • Lastpage
    397
  • Abstract
    Data compression, all of a sudden in the 1990s, has become a huge market. Virtually all operating systems now contain some data compression utility. Compression software packages or plug-in boards can more than double storage capacity in PC disc drives. The data compression method in the V.42bis modem standard, used by more than 50 modem manufacturers, is rapidly spreading into high speed local and remote area networks. Lossless data compression techniques seem, on the surface, too good to be true. If simple software routines or chip sets can double or triple the storage capacity of PCs and transmission speed of modems: why doesn´t everybody do it? The fact is that not all data types can be compressed and for those that can be there remains a range of serious problems including: data expansion, error propagation, encoding speed, uncontrolled library growth and finally patent liabilities
  • Keywords
    Huffman codes; data compression; Huffman codes; Ziv-Lempel codes; data expansion; encoding speed; error propagation; lossless data compression techniques; patent liabilities; Algorithm design and analysis; Computer errors; Data compression; Image coding; Information theory; Modems; Operating systems; Software packages; Telephony; Testing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    WESCON/94. Idea/Microelectronics. Conference Record
  • Conference_Location
    Anaheim , CA
  • ISSN
    1095-791X
  • Print_ISBN
    0-7803-9992-7
  • Type

    conf

  • DOI
    10.1109/WESCON.1994.403566
  • Filename
    403566