Abstract
The article describes the known methods of data compression, considers the features of compression statistical and linguistic methods, with and without losses, relatively static and dynamic models. The capabilities of archivers are described and discusses the various data compression techniques, including statistical and linguistic methods, with and without losses, as well as relatively static and dynamic models. Archivers' capabilities are listed. Data compression is used everywhere. Without data compression a 3-minute song would be over 100Mb in size, while a 10-minute video would be over 1Gb in size. Data compression shrinks big files into much smaller ones. It does this by getting rid of unnecessary data while retaining the information in the file. Data compression can be expressed as a decrease in the number of bits required to illustrate data. Compressing data can conserve storage capacity, accelerate file transfer, and minimize costs for hardware storage and network capacity.
Highlights
When transmitting and storing information, there is always the problem of message size
Information compression methods have been developed as a mathematical theory, which was little used in computers in practice for a long time (Khalifa, 2005; Nelson & Gailly, 1996; Ziv & Lempel, 1977)
The increase in transmission, still images, sound, and video has led to many methods of lossy compression methods or irreversible coding
Summary
When transmitting and storing information, there is always the problem of message size. Information compression methods have been developed as a mathematical theory, which was little used in computers in practice for a long time (until the first half of the 80's) (Khalifa, 2005; Nelson & Gailly, 1996; Ziv & Lempel, 1977). The increase in transmission, still images, sound, and video has led to many methods of lossy compression methods or irreversible coding. To transfer these message types, the following methods may be used. The reverse compression methods are still relevant, which guarantees the full recovery of the original message Such methods include the simplest compression algorithms developed by the classics of coding theory K. Huffman (Kavitha, 2016; Khalifa, 2005; Nelson & Gailly, 1996; Zhen & Ren, 2009; Ziv & Lempel, 1977)
Sign-in/Register to view highlights & summary 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.
