CSC 2508
                          References on

         Information Theory, Coding, and Text Compression

C. Faloutsos,

     Access Methods for Text, ACM Comp. Surv. 17, 1 (March  1985),
     pp. 49-74.

C. Faloutsos,

     Signature Files: Design and Performance  Comparison  of  Some
     Signature   Extraction  Methods,  Proc.  ACM  SIGMOD,  Austin
     (1985), pp. 63-82.

C. Faloutsos and S. Christodoulakis,

     Design of a Signature File  Method  That  Accounts  for  Non-
     uniform  Occurrence and Query Frequencies, Proc. VLDB, Stock-
     holm (1985), pp. 165-170.

C. Faloutsos and S. Christodoulakis

     Optimal Signature Extraction and Information Loss, ACM  TODS,
     12,, 2 (Sept. 1987), pp,395-428.

S.W. Golomb

     Run Length Encodings, IEEE Trans. on Information Theory,  IT-
     12,, (July 1966), pp. 399-401.

M. Grignetti

     A Note on the Entropy of Words in Printed  English,  Informa-
     tion and Control, 7, (1964), pp. 304-306.

D.A. Huffman

     A Method for the Construction of  Minimum  Redundancy  Codes,
     Proc. IRE, 40, (1962), pp. 1098-1101.

M. Jakobsson

     Compression of Character Strings by an  Adaptive  Dictionary,
     BIT, 25, 4 (1985), pp. 593-604.

D.G. Severance

     A Practitioner's Guide to Data Base Compression,  Information
     Systems, 8, 1 (1983). pp. 51-62.

C. Shannon

     Prediction  and  Entropy  of  Printed  English,  Bell  System
     Technical Journal, 30, 1 (1951), pp. 50-64.

T.A. Welch

     A Technique for High-Performance Data Compression, IEEE  Com-
     puter Magazine, 17, 6 (June 1984), pp. 8-19.

I. Witten, R. Neal, and J. Cleary,

     Arithmetic Coding For Data Compression, Comm. ACM 30, 6 (June
     1987).

J. Ziv and A. Lempel

     A Universal Algorithm for Sequential Data  Compression,  IEEE
     Trans. Information Theory, IT-23, 3 (May 1977), pp. 337-343.