Abstract

Analysis for loss less data compression delivers the relevant data about variations of them as well as to describe the possible causes for each algorithm and best performing data types. It describes the basic lossless techniques of data compression Huffman encodes, Arithmetic Encoding, and Lempel Ziv Encodings then briefly with their effectiveness under varying data types of Latin text, audio and video. These properties give the solution of which lossless compression algorithm more suitable compared to other from the Saving Percentage, compression ratio, time of compression and time of decompression with Low Bandwidth Network. Moreover here Lossless Data Compression Algorithms (LDCA) being implemented and tested Huffman compression, Arithmetic compression, and Lempel Ziv algorithms, the implemented result shows that LZW algorithm saves more size than that of the others two with text file, Huffman compression algorithm saves more file sizes and the time takes to compressed decompress is higher than that of other two for audio file type and finally Huffman performs greater on very huge data compressions that is due to much compressing capability.

Full Text
Paper version not known

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

Disclaimer: 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.