By Topic

A Fast Compact Prefix Encoding for Pattern Matching in Limited Resources Devices

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
S. Harrusi ; Sch. of Comput. Sci., Tel Aviv Univ., Tel Aviv, Israel ; A. Averbuch ; N. Rabin

This paper shows how to compress (encode) losslessly, search and decompress (decode) textual data in a machine/device that has a limited memory (several kilobytes).

Published in:

2010 Data Compression Conference

Date of Conference:

24-26 March 2010