Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
