Title :
On Performance of Compressed Pattern Matching on VF Codes
Author :
Yoshida, Satoshi ; Kida, Takuya
Author_Institution :
Grad. Sch. of Inf. Sci. & Technol., Hokkaido Univ., Sapporo, Japan
Abstract :
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.
Keywords :
Huffman codes; data compression; decoding; entropy codes; Huffman coding; Range coding; STVF codes; Tunstall codes; codeword lengths; compressed pattern matching; compression ratio; entropy coding; variable-to-fixed-length codes; Data compression; Decoding; Entropy coding; Information science; Natural languages; Pattern matching;
Conference_Titel :
Data Compression Conference (DCC), 2011
Conference_Location :
Snowbird, UT
Print_ISBN :
978-1-61284-279-0
DOI :
10.1109/DCC.2011.89
