scholarly journals Text File Compression Using Hybrid Run Length Encoding (Rle) Algorithm With Even Rodeh Code (Erc) And Variable Length Binary Encoding (Vlbe) To Save Storage Space

2021 ◽  
Vol 1830 (1) ◽  
pp. 012022
Author(s):  
S M Hardi ◽  
M Zarlis ◽  
D R P Lubis ◽  
P Sihombing ◽  
M Elveny
Keyword(s):  
Variable Length ◽  
Storage Space ◽  
Text File ◽  
Run Length ◽  
Binary Encoding

An on-line variable-length binary encoding of text

1996 ◽  
Vol 94 (1-4) ◽  
pp. 1-22 ◽  
Author(s):  
Tinku Acharya ◽  
Joseph F. Jájá
Keyword(s):  
Variable Length ◽  
Binary Encoding ◽  
On Line

scholarly journals Combination of Cryptography Algorithm Knapsack and Run Length Enconding (RLE) Compression in Treatment of Text File

2020 ◽  
Vol 1573 ◽  
pp. 012017
Author(s):  
Paska Marto Hasugian ◽  
Pandi Barita Nauli Simangunsong ◽  
Muhammad Iqbal Panjaitan ◽  
Dewi Wahyuni ◽  
Syarifah Fadillah Rezky
Keyword(s):  
Text File ◽  
Run Length

scholarly journals A Novel Decode-Aware Compression Technique for Improved Compression and Decompression

2016 ◽  
pp. 120-125
Author(s):  
J. Suresh Babu ◽  
K. Tirumala Rao ◽  
P. Srinivas
Keyword(s):  
Compression Ratio ◽  
Variable Length ◽  
Compression Technique ◽  
Run Length ◽  
Access Delay ◽  
Variable Length Coding ◽  
Stream Size ◽  
Configuration Information ◽  
Good Compression ◽  
Bit Stream

With compressed bit streams, more configuration information can be stored using the same memory. The access delay is also reduced, because less bits need to be transferred through the memory interface. To measure the efficiency of bit stream compression, compression ratio (CR) is widely used as a metric. it is a major challenge to develop an efficient compression technique that can significantly reduce the bit stream size without sacrificing the decompression performance. Our approach combines the advantages of previous compression techniques with good compression ratio and those with fast decompression. This paper makes three important contributions. First, it performs smart placement of compressed bit streams to enable fast decompression of variable-length coding. Next, it selects bitmask-based compression parameters suitable for bit stream compression. Finally, it efficiently combines run length encoding and bitmask-based compression to obtain better compression and faster decompression.

IMPEMENTASI ALGORITMA LEMPEL ZIV STORER SZYMANSKI (LZSS) PADA APLIKASI BACAAN SHALAT BERBASIS ANDROID

2019 ◽  
Vol 3 (1) ◽  
Author(s):  
M. Edo Chandra
Keyword(s):  
Implementation Process ◽  
Original Text ◽  
Storage Space ◽  
Text File ◽  
File Size ◽  
Java Programming ◽  
File Storage ◽  
Large Size ◽  
Storage Area ◽  
Large File

Compression is a way to compress or modify data so that the required storage space is smaller and more efficient. In this study, the large file size in the prayer reading application makes the document storage space requires a lot of storage space due to the large file size. Due to the large size of the file that is currently making a large and inefficient file storage area and the larger size of a file makes the smartphone slow due to the file. The purpose of this study is to design an android-based prayer reading application by implementing the Szymanski Ziv Storer Lempel algorithm (LZSS). And designing a compression application using the Java programming language and database used is SQLite The results of the study show that after carrying out the implementation process with the LZSS algorithm on Reading Prayers, the decompression test results are known to be compressed text files that can be compressed and the size of the decompressed text file is the same as the original text file before it is compressed.Keywords: Implementation, compression, algorithm Lempel Ziv Storer Szymanski (LZSS).

scholarly journals Analisis Perbandingan Kompresi Data dengan Fixed-Length Code, Variable-Length Code dan Algoritma Huffman

2018 ◽  
Author(s):  
Jamaluddin Jamaluddin
Keyword(s):  
Variable Length ◽  
Variable Length Code ◽  
Fixed Length ◽  
Binary Encoding ◽  
Length Code

Dalam ilmu komputer, kompresi data adalah sebuah cara untuk memadatkan data sehingga hanya memerlukan ruang yang lebih kecil sehingga lebih efisien dalam menyimpannya atau mempersingkat waktu pertukaran data tersebut. Dalam tulisan ini, penulis ingin membandingkan efektivitas antara tiga jenis algoritma untuk melakukan kompresi data dalam bentuk teks. Ketiga algoritma tersebut adalah Fixed Length Binary Encoding, Variable Length Binary Encoding dan Algoritma Huffman.

scholarly journals PENGEMBANGAN DAN ANALISIS KOMBINASI RUN LENGTH ENCODING DAN RELATIVE ENCODING UNTUK KOMPRESI CITRA

2016 ◽  
Vol 12 (2) ◽  
Author(s):  
Yosia Adi Jaya ◽  
Lukas Chrisantyo ◽  
Willy Sudiarto Raharjo
Keyword(s):  
Data Compression ◽  
Compression Ratio ◽  
Fast Algorithm ◽  
Data Transfer ◽  
Lossless Compression ◽  
Compression Algorithm ◽  
Storage Space ◽  
Run Length ◽  
Relative Value ◽  
Image Test

Data Compression can save some storage space and accelerate data transfer. Among many compression algorithm, Run Length Encoding (RLE) is a simple and fast algorithm. RLE can be used to compress many types of data. However, RLE is not very effective for image lossless compression because there are many little differences between neighboring pixels. This research proposes a new lossless compression algorithm called YRL that improve RLE using the idea of Relative Encoding. YRL can treat the value of neighboring pixels as the same value by saving those little differences / relative value separately. The test done by using various standard image test shows that YRL have an average compression ratio of 75.805% for 24-bit bitmap and 82.237% for 8-bit bitmap while RLE have an average compression ratio of 100.847% for 24-bit bitmap and 97.713% for 8-bit bitmap.

scholarly journals Run Length Encoding Based Lossless MRI Image Compression Using LZW and Adaptive Variable Length Coding

2019 ◽  
Vol 54 (4) ◽  
Author(s):  
Nassir H. Salman ◽  
Enas Kh. Hassan
Keyword(s):  
Medical Imaging ◽  
Image Compression ◽  
Image Data ◽  
Variable Length ◽  
Imaging Data ◽  
Compression Technique ◽  
Run Length ◽  
Lossless Image Compression ◽  
Variable Length Coding ◽  
Mri Image

Medical image compression is considered one of the most important research fields nowadays in biomedical applications. The majority of medical images must be compressed without loss because each pixel information is of great value. With the widespread use of applications concerning medical imaging in the health-care context and the increased significance in telemedicine technologies, it has become crucial to minimize both the storage and bandwidth requirements needed for archiving and transmission of medical imaging data, rather by employing means of lossless image compression algorithms. Furthermore, providing high resolution and image quality preservation of the processed image data has become of great benefit. The proposed system introduces a lossless image compression technique based on Run Length Encoding (RLE) that encodes the original magnetic resonance imaging (MRI) image into actual values and their numbers of occurrence. The actual image data values are separated from their runs and they are stored in a vector array. Lempel–Ziv–Welch (LZW) is used to provide further compression that is applied to values array only. Finally the Variable Length Coding (VLC) will be applied to code the values and runs arrays for the precise amount of bits adaptively into a binary file. These bit streams are reconstructed using inverse LZW of the values array and inverse RLE to reconstruct the input image. The obtained compression gain is enhanced by 25% after applying LZW to the values array.

Sign in / Sign up

Export Citation Format

Share Document