A typical behavior of some data compression schemes
- 9 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 247-256
- https://doi.org/10.1109/dcc.1991.213356
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- Self-alignments in words and their applicationsJournal of Algorithms, 1992
- Analysis of digital tries with Markovian dependencyIEEE Transactions on Information Theory, 1991
- Some results on V-ary asymmetric triesJournal of Algorithms, 1988
- Paths in a random digital tree: limiting distributionsAdvances in Applied Probability, 1986
- Asymptotical Growth of a Class of Random TreesThe Annals of Probability, 1985
- Linear Algorithm for Data Compression via String MatchingJournal of the ACM, 1981
- A fast string searching algorithmCommunications of the ACM, 1977
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977
- A Space-Economical Suffix Tree Construction AlgorithmJournal of the ACM, 1976
- On the Complexity of Finite SequencesIEEE Transactions on Information Theory, 1976