The asymptotics of string matching probabilities for Gaussian random sequences

DOI10.1017/S0027763000008242MaRDI QIDQ4545218zbMATH OpenOpenAlexFDO

Authors Shunsuke Ihara, Masashi Kubo

Publication date 14 August 2002

Published in Nagoya Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0027763000008242

zbMATH Keywords

data compression algorithmsGaussian stationary processesstring matching with distortionwaiting time for the string matching

Mathematics Subject Classification ID

Large deviations (60F10) Gaussian processes (60G15) Information theory (general) (94A15) Rate-distortion theory in information and communication theory (94A34)

Recommendations

• On the performance of data compression algorithms based upon string matching
• A probabilistic analysis of a pattern matching problem
• A suboptimal lossy data compression based on approximate pattern matching
• The asymptotics of waiting times between stationary processes, allowing distortion
• More on recurrence and waiting times

Cites work

• scientific article; zbMATH DE number 3131354 (Why is no real title available?)
• scientific article; zbMATH DE number 3202900 (Why is no real title available?)
• Large deviations for quadratic forms of stationary Gaussian processes
• Large deviations for quadratic functionals of Gaussian processes
• On the performance of data compression algorithms based upon string matching

Cited in

(2)

• Asymptotic Behavior of k-Word Matches Between two Uniformly Distributed Sequences
• Waiting times: Positive and negative results on the Wyner-Ziv problem

This page was built for publication: The asymptotics of string matching probabilities for Gaussian random sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4545218)