Referenced Items are not available for this document.
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
Published in:
Information Theory, IEEE Transactions on
(Volume:38
,
Issue:
5
)
Date of Publication: Sep 1992
- Page(s):
- 1561 - 1564
- ISSN :
- 0018-9448
- INSPEC Accession Number:
- 4272086
- Digital Object Identifier :
- 10.1109/18.149506
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Sep 1992
- Sponsored by :
- IEEE Information Theory Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
