CUED Publications database

Source coding, large deviations, and approximate pattern matching

Dembo, A and Kontoyiannis, I (2002) Source coding, large deviations, and approximate pattern matching. IEEE Transactions on Information Theory, 48. pp. 1590-1615. ISSN 0018-9448

Full text not available from this repository.


In this review paper, we present a development of parts of rate-distortion theory and pattern-matching algorithms for lossy data compression, centered around a lossy version of the asymptotic equipartition property (AEP). This treatment closely parallels the corresponding development in lossless compression, a point of view that was advanced in an important paper of Wyner and Ziv in 1989. In the lossless case, we review how the AEP underlies the analysis of the Lempel-Ziv algorithm by viewing it as a random code and reducing it to the idealized Shannon code. This also provides information about the redundancy of the Lempel-Ziv algorithm and about the asymptotic behavior of several relevant quantities. In the lossy case, we give various versions of the statement of the generalized AEP and we outline the general methodology of its proof via large deviations. Its relationship with Barton and Orey's generalized AEP is also discussed. The lossy AEP is applied to i) prove strengthened versions of Shannon's direct source-coding theorem and universal coding theorems; ii) characterize the performance of "mismatched" codebooks in lossy data compression; iii) analyze the performance of pattern-matching algorithms for lossy compression (including Lempel-Ziv schemes); and iv) determine the first-order asymptotic of waiting times between stationary processes. A refinement to the lossy AEP is then presented, and it is used to i) prove second-order (direct and converse) lossy source-coding theorems, including universal coding theorems; ii) characterize which sources are quantitatively easier to compress; iii) determine the second-order asymptotic of waiting times between stationary processes; and iv) determine the precise asymptotic behavior of longest match-lengths between stationary processes. Finally, we discuss extensions of the above framework and results to random fields.

Item Type: Article
Divisions: Div F > Signal Processing and Communications
Depositing User: Cron Job
Date Deposited: 08 Jan 2018 20:11
Last Modified: 27 Oct 2020 07:12
DOI: 10.1109/TIT.2002.1003841