Referenced Items are not available for this document.
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.
Published in:
Data Compression Conference (DCC), 2011
Date of Conference: 29-31 March 2011
- Page(s):
- 486
- ISSN :
- 1068-0314
- Print ISBN:
- 978-1-61284-279-0
- INSPEC Accession Number:
- 11933154
- Conference Location :
- Snowbird, UT
- Digital Object Identifier :
- 10.1109/DCC.2011.89
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
