1 |
J. Ziv, A. Lemple, "Compression of Individual Sequences via Variable Rate," IEEE Trans. on Information Theory, Vol. 24, no. 5, pp. 530-536, Sept., 1978
DOI
|
2 |
J. C. Kieffer, E. Yang, G. J. Nelsom, and P. Cosman, "Universal Lossless Compression Via Multilevel Pattern Matching," IEEE Trans. on Information Theory, Vol. 46, no. 4, July 2000
|
3 |
E. Yang, A. Kaltchenko, J. C. Kieffer, "Universal Lossless Data Compression With Side Information by Using a Conditional MPM Grammar Transform, " IEEE Trans. on Information Theory, Vol. 47, no. 6, Sep 2001
|
4 |
C. evill-Manning and I. itten, "Identifying hierarchical structure in sequences: A linear-time algorithm," J. Artificial Intell. Res., vol. 7, pp. 67-82, 1997
|
5 |
J. C. Kieffer, E. H. Yang, "Grammar-Based Codes: A New Class of Universal Lossless Source Codes", IEEE Trans. on Information Theory, Vol. 46, no. 3, pp. 737-754, 2000
DOI
ScienceOn
|
6 |
A. Lempel and J. Ziv, "On the complexity of finite sequences," IEEE Trans, Inform. Theory, vol IT-22, pp. 75, 81, Jan. 1976
|
7 |
C. Cook, A. Rosenfeld, and A. Aronson, "Grammatical inference by hill climbing", Inform, Sec., vol. 10, pp. 59-80, 1997
|
8 |
J. Ziv and A. Lempel, "A Universal Algorithm for Sequential Data Compression," IEEE Trans. on Information Theory, Vol. IT023, no. 3, May 1997
|
9 |
E. Yang and J. C. Kieffer, "Efficient Universal Lossless Data Compression Algorithms Based on a Greedy Sequential Grammar Transform-Part One : Without Context Models," IEEE Trans. on Information Theory, Vol. 46, no.3, May 2000
|
10 |
J. C. Kieffer and E. Yang, "Structured Grammar-Based codes for universal lossless data compression," Communication in Information and Systems, Vol. 2, no. 1, pp.29-52, June 2002
DOI
|
11 |
Y. Hershkovits and J. Ziv, "On Sliding-Window Universal Data Compression with Limited Memory," IEEE Trans. Information Theory, Vol. 44, no. 1, Jan 1998
|