Compression algorithms, such as LZ77 and Huffman, analyze data for redundancies and patterns, allowing them to represent those patterns more efficiently with fewer bits.

But algorithms used on the Linux command line to compress or archive user files have to be able to reproduce the original content exactly. In other words, they have to be lossless. How is that done?