Data Compression Using Adaptive Coding and Partial String Matching

IEEE Transactions on Communications

Volumn 32, Issue 4, 1984, Pages 396-402

  Cleary, John G ^a   Witten, Ian H ^a  

^a UNIVERSITY OF CALGARY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CODES, SYMBOLIC - ENCODING; MATHEMATICAL MODELS;

ADAPTIVE CODING; MARKOV MODEL; PARTIAL STRING MATCHING;

INFORMATION THEORY;

EID: 0021405335     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOM.1984.1096090     Document Type: Article

References (24)

1. L. R. Bahl et al., “Recognition of a continuously read natural corpus,” in Proc. IEEE Int. Conf. Acoust., Speech, Signal Processing, Tulsa, OK, Apr. 1978, pp. 418–424.
2. J. G. Cleary, “An associative and impressible computer,” Ph.D. dissertation, Univ. Canterbury, Christchurch, New Zealand, 1980.
3. J. G. Cleary “Compact hash tables,” IEEE Trans. Comput., to be published.
4. J. G. Cleary, “Representing trees and tries without pointers,” Dep. Comput. Sci., Univ. Calgary, Calgary, Alta., Canada, Res. Rep. 82/102/21, Sept,. 1982.
5. J. G. Cleary and I. H. Witten, “Arithmetic, enumerative and adaptive coding,’.IEEE Trans. Inform. Theory, to be published.
6. T. M. Cover, “Enumerative source encoding,” IEEE Trans. Inform. Theory, vol. IT-19, pp. 73–77, Jan. 1973.
7. M. Guazzo, “A general minimum-redundancy source-coding algorithm,” IEEE Trans. Inform. Theory, vol. IT-26, pp. 15–25, Jan. 1980.
8. C. W. Harrison, “Experiments with linear prediction in television,” Bell Syst. Tech. J., pp. 764–783, July 1952.
9. R. Hunter and A. H. Robinson, “International digital facsimile coding standard,” Proc. IEEE, vol.,68, pp. 854—867, July 1980.
10. C. B. Jones, An efficient coding “system for long source sequences,” IEEE Trans. Inform. Theory, vol. IT-27, pp. 280–291, May 1981.
11. B. W. Kernighan and D. M. Ritchie, The C Programming Language. Englewood Cliffs, NJ: Prentice-Hall, 1978.
12. G. G. Langdon and, J. Rissanen, “Compression Of black-white images. with arithmetic coding,” IEEE Trans. Commun., vol. COM-29, pp. 858–867, June 1981.
13. G. G. Langdon, “A note on the Ziv-Lempel model for compressing individual sequences,” IEEE Trans. Inform. Theory, vol. IT-30, pp. 284—287, Mar. 1983.
14. M. E. Lesk, “Refer,” in Unix Programmers Manual, Bell Lab., Murray, Hill, NJ, 1979.
15. R. Pasco, “Source coding algorithms for fast data compression,” Ph.D. dissertation, Stanford Univ., Stanford, CA, 1976.
16. C. S. Pierce, “The probability of induction,” in The World of Mathematics, vol. 2, J. R. Newman, Ed. New York: Simon and Schuster, 1956, pp: 1341-1354:
17. J. Raviv, “Decision making in Markov chains applied to the problem of pattern recognitioh,” IEEE Trans. Inform. Theory, vol. IT-13, pp. 536–551, Oct. 1967.
18. J. J. Rissanen, “Arithmetic codings as number representations,” Acta. Polytech. Scandinavica, vol. Math. 31, pp. 44—51, 1979.
19. J. J. Rissanen and G. G. Langdon, “Universal modeling and coding,” IEEE Trans. Inform: Theory, vol. IT-27, pp. 12–23, Jan. 1981.
20. M. G. Roberts, “Local order estimating Markovian analysis fOr noiseless source coding and authorship identification,” Ph.D. dissertation, Stanford Univ., Stanford, CA, 1982.
21. H. E. White, “Printed English compression by dictionary encoding,” Proc. IEEE, vol. 55, pp. 390–396, 1967.
22. I. H. Witten, “Approximate, non-deterministic modelling of behaviour sequences,” Int. J. General Syst., vol. 5, pp. 1–12, Jan. 1979.
23. I. H. Witten, Principles of Computer Speech. London, England: Academic, 1982.
24. J. Ziv and A. Lempel, “Compression of individual sequences via variable-rate coding,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 530–536, Sept. 1978.