• DocumentCode
    1031012
  • Title

    The Lempel-Ziv algorithm and message complexity

  • Author

    Gilbert, E.N. ; Kadota, T.T.

  • Author_Institution
    AT&T Bell Lab., Murray Hill, NJ, USA
  • Volume
    38
  • Issue
    6
  • fYear
    1992
  • fDate
    11/1/1992 12:00:00 AM
  • Firstpage
    1839
  • Lastpage
    1842
  • Abstract
    Data compression has been suggested as a nonparametric way of discriminating between message sources. Compressions obtained from a Lempel-Ziv algorithm for relatively short messages, such as those encountered in practice, are examined. The intuitive notion of message complexity has less connection with compression than one might expect from known asymptotic results about infinite messages. Nevertheless, discrimination by compression remains an interesting possibility
  • Keywords
    binary sequences; communication complexity; data compression; Lempel-Ziv algorithm; binary sources; data compression; message complexity; nonparametric discrimination; Data compression; Distributed computing; Entropy; H infinity control; Information theory; Probability distribution;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.165463
  • Filename
    165463
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1031012