The asymptotics of string matching probabilities for Gaussian random sequences

Author

Ihara, Shunsuke ; Kubo, Masashi

Author_Institution

Sch. of Inf. & Sci., Nagoya Univ., Japan

fYear

1998

fDate

16-21 Aug 1998

Firstpage

414

Abstract

Wyner and Ziv (1989) studied the asymptotic properties of recurrence times of stationary processes, and applied the results to obtain optimal data compression schemes in information transmission. Since then many data compression algorithms based upon string matching have been proposed and studied. We consider Gaussian stationary sources and study the problem of string matching with distortion. We prove theorems concerning the asymptotic behavior of the probability of string matching with distortion and the waiting time for the string matching

Keywords

Gaussian processes; data compression; probability; random processes; sequences; string matching; Gaussian random sequences; Gaussian stationary sources; asymptotic properties; data compression algorithms; distortion; information transmission; optimal data compression; recurrence times; stationary processes; string matching probabilities; theorems; waiting time; Data compression; Databases; Density functional theory; Distortion measurement; Entropy; Mutual information; Probability distribution; Random sequences; Stochastic processes;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on

Conference_Location

Cambridge, MA

Print_ISBN

0-7803-5000-6

Type

conf

DOI

10.1109/ISIT.1998.709019

Filename

709019