Asymptotic properties of data compression and suffix trees

DOI10.1109/18.259648zbMath0802.94007OpenAlexW2035281110MaRDI QIDQ4307377

Wojciech Szpankowski

Publication date: 3 October 1994

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/54d074b78a9c8fdebf3520d655100685d72239b5

zbMATH Keywords

asymptotic analysissuffix treeuniversal data compressionLempel-Ziv parsing algorithmrepeated subwords

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Source coding (94A29)

Related Items (9)

Stochastic sub-additivity approach to the conditional large deviation principle ⋮ Suffix-sorting via Shannon-Fano-Elias codes ⋮ Text indexing with errors ⋮ Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees ⋮ Probabilistic modeling of data structures on words. A reply to Professor Andersson's letter ⋮ Uncommon suffix tries ⋮ Optimal encoding of non-stationary sources ⋮ A new method for approximate indexing and dictionary lookup with one error ⋮ The asymptotics of waiting times between stationary processes, allowing distortion

This page was built for publication: Asymptotic properties of data compression and suffix trees