By Topic

Efficient data compression using character replacement through generated code

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 $13
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)
Chakroborty, D. ; Dept. of Comput. Sci. & Eng., St. Thomas'' Coll. of Eng. & Technol., Kolkata, India ; Bera, S. ; Gupta, A.K. ; Mondal, S.

The algorithm employs a technique which unlike other is independent of repetition. It is based on the replacement of characters through generated code. The total characters used in a file can be arranged in the different dimension of a matrix. Each cell of the matrix will contain a unique code, which will be replaced for respective combination of characters. Further, the codes can be reduced to the binary system to get the final compressed file. It is a simple compression and decompression process which is free from huge dictionary and time complexity and moreover the codes are generated for each combination, hence independent of repetition.

Published in:

Emerging Trends and Applications in Computer Science (NCETACS), 2011 2nd National Conference on

Date of Conference:

4-5 March 2011