Rearrangement and Grouping of Data Bits for Efficient Lossless Encoding

Ajitha K.B. Shenoy, Meghana Ajith, Vinayak M. Mantoor

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Article number012029
JournalJournal of Physics: Conference Series
Issue number1
Publication statusPublished - 08-02-2017
Event2016 International Conference on Communication, Image and Signal Processing, CCISP 2016 - Dubai, United Arab Emirates
Duration: 18-11-201620-11-2016

All Science Journal Classification (ASJC) codes

  • General Physics and Astronomy


Dive into the research topics of 'Rearrangement and Grouping of Data Bits for Efficient Lossless Encoding'. Together they form a unique fingerprint.

Cite this