Fast searching over compressed text using a new coding technique: tagged sub-optimal code (TSC)

In this paper, a new coding technique called tagged sub-optimal code (TSC) is proposed. TSC is a variable-length sub-optimal code that supports minimal prefix property. TSC technique is beneficial in many types of applications: speeding up string matching over compressed text, speeding decoding process, robustness of error detection and recovery during transmission, as well as in general-purpose integer representation code. The experimental results show that TSC is 8.9 times faster than string matching over compressed text using Huffman encoding, and 3 times faster in the decoding process.