Followblock this user
The University of Kansas, Department of Electrical Engineering & Computer Science, Lawrence, KS, USA
Dictionary selection using partial matching
Oh la la
Your session has expired but donâ€™t worry, your message
has been saved.Please log in and weâ€™ll bring you back
to this page. Youâ€™ll just need to click â€śSendâ€ť.
Your evaluation is of great value to our authors and readers. Many thanks for your time.
When you're done, click "publish"
Only blue fields are mandatory.
Your mailing list is currently empty.
It will build up as you send messages
and links to your peers.
besides you has access to this list.
Enter the e-mail addresses of your recipients in the box below. Note: Peer Evaluation will NOT store these email addresses log in
Your message has been sent.
Full text for this article was not available? Send a request to the author(s)
: Dictionary selection using partial matching
Abstract : This work concerns the search for text compressors that compress better than existing dictionary coders, but run faster than statistical coders. We describe a new method for text compression using multiple dictionaries, one for each context of preceeding characters, where the contexts have varying lengths. The context to be used is determined using an escape mechanism similar to that of prediction by partial matching (PPM) methods. We describe modifications of three popular dictionary coders along these lines and experiments evaluating their effectiveness using the text ®les in the Calgary corpus. Our results suggest that modifying LZ77, LZFG, and LZW along these lines yields improvements in compression of about 3%, 6%, and 15%, respectively.
: Computer Science
Leave a comment
This contribution has not been reviewed yet. review?