Average profile of the Lempel-Ziv parsing scheme for a Markovian source

DOI10.1007/S00453-001-0053-3zbMath1020.68034OpenAlexW1977970493MaRDI QIDQ5953104

Wojciech Szpankowski, Philippe Jacquet, Jing Tang

Publication date: 14 January 2002

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=2416&context=cstech

zbMATH Keywords

digital search treesLempel-Ziv parsing scheme

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (5)

Gaussian Distribution of Trie Depth for Strongly Tame Sources ⋮ Joint string complexity for Markov sources: small data matters ⋮ The expected profile of digital search trees ⋮ On the average redundancy rate of the Lempel-Ziv code with the \(k\)-error protocol ⋮ Data compression and learning in time sequences analysis

This page was built for publication: Average profile of the Lempel-Ziv parsing scheme for a Markovian source