Journal of Graduate Studies - VOL - 41-2

Permanent URI for this collectionhttps://repository.neelain.edu.sd/handle/123456789/11808

Browse

Search Results

Now showing 1 - 1 of 1
  • Thumbnail Image
    Item
    Comparison Between (RLE And Huffman) Algorithms for Lossless Data Compression
    (جامعة النيلين - مجلة الدراسات العليا, 2018-04-15) Dr. AMIN MUBARK ALAMIN IBRAHIM
    Multimedia field is distinguished from other areas of the need for massive storage volumes. This caused a lot of problems, particularly the speed of reading files when (transmission and reception) and increase the cost (up capacities petition) was to be the presence of ways we can get rid of these problems resulting from the increase Size was one of the successful solutions innovation algorithms to compress files. This paper aims to compare between (RLE and Huffman) algorithms which are also non- compression algorithms devoid texts, according to the standard file size. Propagated the comparison between the original file size and file size after compression using (RLE & HUFFMAN) algorithms for more than (30) text file. We used c++ program to compress the files and Microsoft excel program in the description analysis so as to calculate the compression ratio and others things. The study pointed to the effectiveness of the algorithm (HUFFMAN) in the process of reducing the size of the files.