Date: Fri Nov 19 18:37:18 2010
Authors: Satoshi Yoshida and Takuya Kida
Abstract. This paper discusses about pattern matching 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 present some experimental results about the compression ratios and encoding/decoding speeds besides pattern matching performance on Tunstall codes and STVF codes. We also present how an entropy coding affects to VF codes.
©Copyright 2010 Authors