Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

Text compression as rule based pattern recognition

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
$31 $31
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

4 Author(s)
Khan, H.U. ; Dept. of Electron. & Electr. Eng., King's Coll., London, UK ; Ahmad, J. ; Mahmood, A. ; Fatmi, H.A.

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 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.

Published in:

Electronics Letters  (Volume:29 ,  Issue: 20 )