Encoding a character in an efficient way is always desirable because it takes less bits and
less time for data. It has many application areas including data communication, data storage …

Character encoding implies representing a repertoire of characters by some sort of encoding
framework. Encoding a character in a compelling procedure is in every case estimable in …

This paper presents how ternary representation of numbers can be utilized to compress text
data with fixed-symbol-length coding techniques. We use a binary map for ternary digits and …

In this paper we reduce the number of bits required to represent a character by using 6-bit
binary coding instead of a 8-bit binary coding technique. We use a numbering map for …

Data compression is the way toward modifying, encoding or changing over the bit structure
of data in such a way that it expends less space. Character encoding is somewhat related to …

Data compression means the route towards adjusting, encoding or changing the bit structure
of information so that it requires less space. The fundamental standard behind compression …

Huffman is one of the compression algorithms. It is the most famous algorithm to compress
text. There are four phases in the Huffman algorithm to compress text. The first is to group …

This paper presents a new and efficient method for text compression using tri-grams
dictionary. There have been many methods proposed to text compression such as: run …

For storing a word or the whole text segment, we need a huge storage space. Typically a
character requires 1 Byte for storing it in memory. Compression of the memory is very …

Information technology is growing very rapidly, in particular for data handling. Data is a
valuable asset for everyone, especially for larger companies with branches in several …