Design of context-free grammars for lossless data compression

1998 Information Theory Workshop, ITW 1998

Volumn , Issue , 1998, Pages 84-85

  Kieffer, J C ^a   Yang, En Hui ^b  

^a University of Minnesota   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT FREE GRAMMARS; DATA COMPRESSION; INFORMATION THEORY;

COMPRESSION ALGORITHMS; DATA STRINGS; FINITE ALPHABET; IN CONTEXTS; LOSSLESS DATA COMPRESSION;

CONTEXT FREE LANGUAGES;

EID: 84938843483     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITW.1998.706446     Document Type: Conference Paper

References (4)

1. J. Kieffer and Eh. Yang, "Ergodic behavior of graph entropy," ERA Amer. Math. Soc., vol. 3, pp. 11-16, 1997.
2. J. Kieffer and E-h. Yang, "Design of context-free grammars for lossless data compression," Technical Report, Dept. of Electrical & Computer Engineering, University of Minnesota Twin Cities.
3. C. Nevill-Manning and I. Witten, "Identifying hierarchical structure in sequences: a linear-time algorithm," Jour. Artificial Intell. Res., vol. 7, pp. 67-82, 1997.
4. C. Nevill-Manning and I. Witten, "Cornpr-ession and esplanation using hierarchical grammars," Computer Journal, vol. 40, pp. 103-116,1997.