Majed AbuSafiya1, *
CMC-Computers, Materials & Continua, Vol.64, No.1, pp. 17-30, 2020, DOI:10.32604/cmc.2020.09282
- 20 May 2020
Abstract Huffman [Huffman (1952)] encoding is one of the most known compression
algorithms. In its basic use, only one encoding is given for the same letter in text to
compress. In this paper, a text compression algorithm that is based on Huffman encoding
is proposed. Huffman encoding is used to give different encodings for the same letter
depending on the prefix preceding it in the word. A deterministic finite automaton (DFA)
that recognizes the words of the text is constructed. This DFA records the frequencies for
letters that label the transitions. Every state will correspond to More >
Login
Register
