2014
DOI: 10.5958/2322-0465.2014.01118.6
|View full text |Cite
|
Sign up to set email alerts
|

A Comparative Analysis of Data Compression Techniques

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(5 citation statements)
references
References 1 publication
0
5
0
Order By: Relevance
“…The efficiency of the algorithm can be improved if the data uses only two symbols (e.g. 0 and 1) in its bit pattern and frequency of one symbol should be more than the other (Souley et. al, 2014).…”
Section: Run Length Encoding (Rle)mentioning
confidence: 99%
See 3 more Smart Citations
“…The efficiency of the algorithm can be improved if the data uses only two symbols (e.g. 0 and 1) in its bit pattern and frequency of one symbol should be more than the other (Souley et. al, 2014).…”
Section: Run Length Encoding (Rle)mentioning
confidence: 99%
“…al, 2014). Figure 2: Run-length encoding for two symbols (Souley et. al, 2014) In this algorithm, repeated pixel can be substituted by a number that indicate which pixel value is repeated and how many times it is repeated (Singh and Devgon, 2019).…”
Section: Run Length Encoding (Rle)mentioning
confidence: 99%
See 2 more Smart Citations
“…Run-length encoding does not reduce the average symbol size when compared with Huffman coding. It also does not need dictionary of reference as in Lempel-Ziv coding (Souley et al, 2014).…”
Section: Art Of Video Compression and Its Terminologymentioning
confidence: 99%