Abstract

A novel algorithm for text compression is developed which consists of two parts. In the first part the text sample is encoded by the Ziv-Lempel asymptotic structured codebook. In the second part decoding is carried out by a novel rule based (RB) algorithm which improves the compression ratio for a given text sample by up to 50% when compared to the full text search as required by the Ziv-Lempel decoding algorithm.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.