Abstract
This paper presents the design and implementation of a data compression scheme that can be used for PC software distribution. The method utilizes a lazy parsing strategy and a large sliding-window to obtain good compression ratio. A large window is used to read in characters from a file and a suffix tree is constructed to search for the longest matching substring. Lazy parsing is used to improve the compression performance moderately. Modified unary codes and Huffman codes are used to encode the displacements, copy-lengths and copied symbols. Although the encoder is complex, the expansion phase of such a coder is simple and works very fast; experimental results confirm this fact. Such a compression scheme is most appropriate to be used for PC software distribution.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.