z-logo
open-access-imgOpen Access
Comparison of Text Data Compression Using Yamamoto Recursive Codes and Punctured Elias Codes
Author(s) -
Surya Hardi,
Muhammad Rizky Putra,
Jos Timanta Tarigan,
Ivan Jaya
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1566/1/012083
Subject(s) - ascii , uncompressed video , benchmark (surveying) , compression (physics) , block code , computer science , algorithm , linear code , discrete mathematics , mathematics , theoretical computer science , decoding methods , physics , programming language , thermodynamics , geodesy , process (computing) , video tracking , geography
This research aims to study the efficiency of two variants of variable-length codes (i.e., Yamamoto Recursive codes and Punctured Elias codes) in compressing texts. The parameter being examined are the ratio of compression, the space savings, and the bit rate. As a benchmark, all of the original (uncompressed) texts are assumed to be encoded in American Standard Codes for Information Interchange (ASCII). The overall result shows that the Punctured Elias codes are consistently more efficient to compress texts than Yamamoto Recursive codes.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here