2010 Data Compression Conference (DCC 2010) (2010)
March 24, 2010 to March 26, 2010
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DCC.2010.72
Summary form only given.The hierarchical Edge-Guided techniques (called E-Gfc) enhance the original E-G approach to support high-order text statistics. These consider the same graph-based model to represent an extended input alphabet obtained by using a variant of the Re-Pair algorithm. E-Gfc adapts the previous coding scheme to grasp the features of the bit-oriented canonical Huffman code chosen as output alphabet.
graph theory, higher order statistics, Huffman codes, text analysis, word processing
M. A. Martínez-Prieto, J. Adiego, P. d. Fuente and J. D. Fernández, "High-Order Text Compression on Hierarchical Edge-Guided," 2010 Data Compression Conference (DCC 2010)(DCC), Snowbird, UT, 2010, pp. 543.