An efficient 6 bit encoding scheme for printable characters by table look up
Md. Ashiq Mahmood, Tarique Latif, K. M. Azharul Hasan · 2017
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 and database technology. In this paper we propose a new compression algorithm for text data that encodes any character by 6 bits called 6-bit encoding (6BE). The scheme deals with an encoding technique by 6 bits for printable characters using table look up. 6BE converts the 8 bit characters to 6 bits by dividing the characters into 5 sets and using them in a single table. The location of character is then used uniquely to encode by 6 bits. The 6BE can compress the text by 25% of the original text. The reverse algorithm for decomposition to get back the original text is also described. 6BE encoding produces another set of characters. The result of 6BE string is further compressed by Huffman and LZW algorithm. Our experimental result shows promising performance. Examples and descriptions are provided to explain the technique.