Data compression using selective encoding

Image analysis – Image compression or coding – Lossless compression

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

395114, H03M 730

Patent

active

059701773

ABSTRACT:
A data compression method that uses selective encoding is disclosed. A block of data is compressed using a combination of the LZ77 and Huffman coding techniques. Each compressed block consists of a pair of Huffman code trees that describe the representation of the compressed data part and a compressed data part. Compressed data may consist of literal data that has not been detected as duplicated and length/backward pairs indicating the location of a duplicated string. Compressed data is arranged in a deflate format.

REFERENCES:
patent: 4881075 (1989-11-01), Weng
patent: 5010344 (1991-04-01), Nagy
patent: 5010345 (1991-04-01), Nagy
patent: 5488365 (1996-01-01), Seroussi et al.
D. S. Hirschberg and D. A. Lelewer, "Efficient decoding of prefix codes", Comm. ACM, 33, 4, pp. 449-459, Apr. 1990.
J. Ziv & A. Lempel, "A Universal Algorithm for Sequential Data Compression," IEEE transactions on Information theory, vol. 23, No. 3, pp. 337-343.
D. A. Huffman, "A Method for the Construction of Minimum Redundancy Codes," Proceedings of the Institute of Radio Engineers, vol. 40, No. 9, pp. 1098-1101.
E. S. Schwartz & B. Kallick, "Generating a canonical prefix encoding," Comm. ACM, 7, 3, pp. 166-169 (Mar., 1964).
E. R. Fiala & D. H. Greene, "Data Compression with Finite Windows," Comm. ACM, 32, 4, pp. 490-505 (1989).
R. Sedgewick, "Algorithms", p. 252.

LandOfFree

Say what you really think

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

Rating

Data compression using selective encoding 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 selective encoding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Data compression using selective encoding will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2066472

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