Rearrangement and Grouping of Data Bits for Efficient Lossless Encoding

This paper describes the efficacy of rearranging and grouping of data bits. Lossless encoding techniques like Huffman Coding, Arithmetic Coding etc., works well on data which contains redundant information. The idea behind these techniques is to encode more frequently occurring symbols with less number of bits and more seldom occurring symbols with more number of bits. Most of the methods fail if there is a non-redundant data. We propose a method to re arrange and group data bits there by making the data redundant and then different lossless encoding techniques can be applied. In this paper we propose three different methods to rearrange the data bits, and efficient way of grouping them. This is first such attempt. We also justify the need of rearranging and grouping data bits for efficient lossless encoding.