Data compression using hashing

H - Electricity – 03 – M

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

H03M 7/30 (2006.01) G06T 9/00 (2006.01)

Patent

CA 2130897

2130897 9317503 PCTABS00025 Compressing a sequence of characters drawn from an alphabet uses string substitution with no a priori information. An input data block is processed into an output data block comprised of variable length incompressible data sections and variable length compressed token sections. Multiple hash tables are used based on different subblock sizes for string matching, and this improves the compression ratio and rate of compression. The plurality of uses of the multiple hash tables allows for selection of an appropriate compression data rate and/or compression factor in relation to the input data. Using multiple hashing tables with a recoverable hashing method further improves compression ratio and compression rate. Each incompressible data section contains means to distinguish it from compressed token sections.

LandOfFree

Say what you really think

Search LandOfFree.com for Canadian inventors and patents. Rate them and share your experience with other people.

Rating

Data compression using hashing does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Data compression using hashing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Data compression using hashing will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFCA-PAI-O-1687165

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.