Rearrangement and Grouping of Data Bits for Efficient Lossless Encoding

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

Research output: Contribution to journalArticle

Abstract

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
Volume787
Issue number1
DOIs
Publication statusPublished - 08-02-2017

Fingerprint

coding

All Science Journal Classification (ASJC) codes

  • Physics and Astronomy(all)

Cite this

Shenoy, Ajitha K.B. ; Ajith, Meghana ; Mantoor, Vinayak M. / Rearrangement and Grouping of Data Bits for Efficient Lossless Encoding. In: Journal of Physics: Conference Series. 2017 ; Vol. 787, No. 1.
@article{1b4434d043454f47a5c497fd3f7eae93,
title = "Rearrangement and Grouping of Data Bits for Efficient Lossless Encoding",
abstract = "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.",
author = "Shenoy, {Ajitha K.B.} and Meghana Ajith and Mantoor, {Vinayak M.}",
year = "2017",
month = "2",
day = "8",
doi = "10.1088/1742-6596/787/1/012029",
language = "English",
volume = "787",
journal = "Journal of Physics: Conference Series",
issn = "1742-6588",
publisher = "IOP Publishing Ltd.",
number = "1",

}

Rearrangement and Grouping of Data Bits for Efficient Lossless Encoding. / Shenoy, Ajitha K.B.; Ajith, Meghana; Mantoor, Vinayak M.

In: Journal of Physics: Conference Series, Vol. 787, No. 1, 012029, 08.02.2017.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Rearrangement and Grouping of Data Bits for Efficient Lossless Encoding

AU - Shenoy, Ajitha K.B.

AU - Ajith, Meghana

AU - Mantoor, Vinayak M.

PY - 2017/2/8

Y1 - 2017/2/8

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85014580176&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85014580176&partnerID=8YFLogxK

U2 - 10.1088/1742-6596/787/1/012029

DO - 10.1088/1742-6596/787/1/012029

M3 - Article

VL - 787

JO - Journal of Physics: Conference Series

JF - Journal of Physics: Conference Series

SN - 1742-6588

IS - 1

M1 - 012029

ER -