Abstract
Compression is the process of encoding using fewer bits to remove redundant information, resulting in smaller data size. There are two types of data compression techniques that are used to compress different data formats, namely lossless and lossy compression techniques. In this research, we use a lossless data compression methodology to compare both Rice Code and Even-Rodeh Code algorithms with Ratio of Compression, Space Savings, Time Process, and the Bit Rate parameters. This research was conducted by the Canterbury Corpus files and shows that the Rice Code algorithm is more efficient to compress text files.
Sign-in/Register to access full text options 
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.
