String matching bounds via coding

DOI10.1214/AOP/1024404290zbMath0873.60029OpenAlexW2000784587MaRDI QIDQ1356344

Paul C. Shields

Publication date: 9 June 1997

Published in: The Annals of Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aop/1024404290

zbMATH Keywords

string matchingprefix codes

Mathematics Subject Classification ID

Sample path properties (60G17) Coding theorems (Shannon theory) (94A24)

Related Items (4)

Variable-length coding of two-sided asymptotically mean stationary measures ⋮ Non-parametric change-point estimation using string matching algorithms ⋮ A Central Limit Theorem for Non-Overlapping Return Times ⋮ Excess entropy in natural language: Present state and perspectives

Cites Work

• Unnamed Item
• Unnamed Item
• How sampling reveals a process
• Entropy and prefixes
• String matching: The ergodic case
• The Erdős-Rényi strong law for pattern matching with a given proportion of mismatches
• Entropy and data compression schemes
• An Entropy Estimator for a Class of Infinite Alphabet Processes

This page was built for publication: String matching bounds via coding