On Performance of Compressed Pattern Matching on VF Codes

This paper discusses pattern matching problem on Variable-to-Fixed-length codes (VF codes). A VF code is a coding scheme whose codeword lengths are fixed, and thus it is suitable for comprssed pattern matching. However, there are few reports showing its efficiency so far. We have investigated into the compression ratios and encoding/decoding speeds besides pattern matching performance on Tunstall codes and STVF codes. We have also done how an entropy coding affects to VF codes. In our experiments, we tested Huffman coding and Range coding for entropy codings.