• DocumentCode
    2053687
  • Title

    An almost sure convergence proof of the sliding-window Lempel-Ziv algorithm

  • Author

    Lastras, Luis A.

  • Author_Institution
    Multimedia Technol. Dept., IBM TJ Watson Res. Center, Yorktown Heights, NY, USA
  • fYear
    2002
  • fDate
    2002
  • Firstpage
    121
  • Abstract
    An almost sure convergence proof of a finite memory version of the sliding window Lempel-Ziv algorithm (LZ77) is given. The proof is valid for those sources that in addition to being stationary and ergodic, have exponential rates for entropy.
  • Keywords
    convergence; data compression; entropy; source coding; almost sure convergence proof; data compression; entropy; ergodic sources; finite memory version; sliding-window Lempel-Ziv algorithm; stationary sources; Convergence; Cost function; Data compression; Databases; Electronic mail; Entropy; H infinity control; Length measurement; Random processes; Size measurement;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on
  • Print_ISBN
    0-7803-7501-7
  • Type

    conf

  • DOI
    10.1109/ISIT.2002.1023393
  • Filename
    1023393
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2053687