Lossless Data Compression,Algorithms Comparisons And Implementation.

Since 1970s mathematical algorithms have been proposed to find ways to reduce file size.As a consequence of the evolution of the Internet and the exponential increas-ing in the data scale,there has been a growing need to create better compression schemes.Data compression is a process that reduces data size by removing re-dundancy and involves encoding information(sometime improving data security)using less bits containing the same information.This process conserves energy in every step of a file transfer,reduces the storage required for saving data,and thus reduces communication costs by effectively using the available bandwidth.In this thesis,we provide an overview of lossless data compression,covering tech-niques from Huffman and LZ77 and algorithms such as Deflate,Gzip,and Brotli.Some comparisons that have been made lately between different compression al-gorithms are also shown.As a result,Brotli is proposed as the modern alternative web page,mobile application,and off-line compression algorithm.Due to the lack of studies and public documentation related to this new compression algorithm mathematical model,we focus on the strengths of integrating available informa-tion to justify Brotli's selection and provide a broad and necessary knowledge that will help the reader better understand how lossless data compression works.Finally,a technological implementation is carried out using R.