• DocumentCode
    1134119
  • Title

    A recurrence theorem for dependent processes with applications to data compression

  • Author

    Nobel, Andrew ; Wyner, Aaron D.

  • Author_Institution
    Inf. Syst. Lab., Stanford Univ., CA, USA
  • Volume
    38
  • Issue
    5
  • fYear
    1992
  • fDate
    9/1/1992 12:00:00 AM
  • Firstpage
    1561
  • Lastpage
    1564
  • Abstract
    In an earlier work, Wyner and Ziv (see ibid., vol.35, no.6, p.1250-8, 1989) proved theorems on recurrence times for strings in a random sequence, and applied these theorems to data compression and the Lempel-Ziv algorithm. It is shown that one of these theorems holds under an essentially weaker hypothesis. The new proof is considerably simpler than the original
  • Keywords
    data compression; entropy; information theory; random processes; Lempel-Ziv algorithm; data compression; dependent processes; entropy; random sequence; recurrence theorem; stationary ergodic sequence; Data compression; Decoding; Error analysis; Error correction; Random sequences;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.149506
  • Filename
    149506
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1134119