Universal coding of nonstationary sources
| Autor: | Sanjeev R. Kulkarni, Sergio Verdu, K. Visweswariah |
|---|---|
| Rok vydání: | 2000 |
| Předmět: |
Block code
Source code Theoretical computer science media_common.quotation_subject Tunstall coding Variable-length code Data_CODINGANDINFORMATIONTHEORY Library and Information Sciences Coding tree unit Computer Science Applications Shannon–Fano coding Algorithm Context-adaptive binary arithmetic coding Information Systems media_common Coding (social sciences) Mathematics |
| Zdroj: | IEEE Transactions on Information Theory. 46:1633-1637 |
| ISSN: | 0018-9448 |
| DOI: | 10.1109/18.850707 |
| Popis: | We investigate the performance of the Lempel-Ziv (1978) incremental parsing scheme on nonstationary sources. We show that it achieves the best rate achievable by a finite-state block coder for the nonstationary source. We also show a similar result for a lossy coding scheme given by Yang and Kieffer (see ibid., vol.42, p.239-45, 1996) which uses a Lempel-Ziv scheme to perform lossy coding. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|