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.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
