Abstract
The use of Knuth-Morris-Pratt (KMP) algorithm for compressed pattern matching in Huffman encoded texts was discussed. The algorithm was used to solve the problem of false matches, i.e., an occurrence of the encoded pattern in the encoded text that did not correspond to an to an occurrence of the pattern itself in the original text. The bitwise KMP algorithm moved one extra bit in the case of mismatch, since the alphabet was binary. The KMP algorithm was combined with two Huffmann decoding in order to handle more than a single bit per machine operation.
| Original language | English |
|---|---|
| Pages (from-to) | 535 |
| Number of pages | 1 |
| Journal | Proceedings of the Data Compression Conference |
| State | Published - 2004 |
| Externally published | Yes |
| Event | Proceedings - DCC 2004 Data Compression Conference - Snowbird, UT., United States Duration: 23 Mar 2004 → 25 Mar 2004 |