COMPARISON OF LOSSLESS DATA COMPRESSION ALGORITHMS FOR TEXT DATA
Journal Title: Indian Journal of Computer Science and Engineering - Year 2010, Vol 1, Issue 4
Abstract
Data compression is a common requirement for most of the computerized applications. There are number of data compression algorithms, which are dedicated to compress different data formats. Even for a single data type there are number of different compression algorithms, which use different approaches. This paper examines lossless data compression algorithms and compares their performance. A set of selected algorithms are examined and implemented to evaluate the performance in compressing text data. An experimental comparison of a number of different lossless data compression algorithms is presented in this paper. The article is concluded by stating which algorithm performs well for text data.
Authors and Affiliations
S. R. KODITUWAKKU , U. S. AMARASINGHE
PROPOSED PROFILE TRANSLATION IN CONTEXT AWARE PROACTIVE SYSTEM
The advancement of mobile devices and Internet has given us great platform for our day to day tasks. Various Activities like ticket booking; shopping, paying bills have been done on the fly.The Smartphone adds portabilit...
AN EFFICIENT TEXT CLUSTERING ALGORITHM USING AFFINITY PROPAGATION
The objective is to find among all partitions of the data set, best publishing according to some quality measure. Affinity propagation is a low error, high speed, flexible, and remarkably simple clustering algorithm that...
A study on different approaches towards Aspect Oriented Requirements Engineering
Requirements and their quality are very important for the success and on time delivery of a project. However, Requirement Elicitation is not an easy and small task to begin with. Conflicts arise in various ways such as w...
JOINT CHANNEL ESTIMATION AND DECODING OF RAPTOR CODE ON FADING CHANNEL
In this paper, the problem of transmission of Raptor codes over fading channel is considered. We present in this paper joint decoder architecture for Raptor codes over phase coherent fading channel. The proposed scheme d...
UNIVERSAL APPROXIMATION WITH NON-SIGMOID HIDDEN LAYER ACTIVATION FUNCTIONS BY USING ARTIFICIAL NEURAL NETWORK MODELING
Neural networks are modeled on the way the human brain. They are capable of learning and can automatically recognize by skillfully training and design complex relationships and hidden dependencies based on historical exa...