2013International Journal of Computer and Communication TechnologyRequires access

A modified approach to the new lossless data Compression method

Bitla Srinivas, V. K. Govindan

Open publisher page 1 citations

Abstract

This paper proposed the modified approach to the new lossless data compression method. It is developed based on hiding data reversibly with a location map. It performs same as the earlier algorithm but it stands on lossless strategy where as the former approach could not do it. It can compress any kind of symbols as it operates on binary symbols. It is faster than many algorithms as it does not have any complex mathematical operations. Experimental results proved that when the symbol probability increases the algorithm shows good compression ratio.

About this research paper

What this paper is about

This paper proposed the modified approach to the new lossless data compression method. It is developed based on hiding data reversibly with a location map. It performs same as the earlier algorithm but it stands on lossless strategy where as the former approach could not do it. It can compress any kind of symbols as it operates on binary symbols. It is faster than many algorithms as it does not have any complex mathematical operations. Experimental results proved that when the symbol probability increases the algorithm shows good compression ratio.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This paper proposed the modified approach to the new lossless data compression method. It is developed based on hiding data reversibly with a location map. It performs same as the earlier algorithm but it stands on lossless strategy where as the former approach could not do it. It can compress any kind of symbols as it operates on binary symbols. It is faster than many algorithms as it does not have any complex mathematical operations. Experimental results proved that when the symbol probability increases the algorithm shows good compression ratio.

Key concepts: Lossless compression, Data compression, Computer science, Compression (physics), Binary number, Algorithm, Data compression ratio, Symbol (formal)

Related papers

Back to paper searchBrowse research topicsOriginal source
A modified approach to the new lossless data Compression method — Research Paper | ScholarLens