Data Compression
This courselet provides a hands-on exploration of two widely used lossless compression techniques: Huffman coding and DEFLATE. Learners will compress structured and randomized text data to evaluate how each algorithm performs under different conditions. Through practical experiments and analysis, the courselet highlights the strengths and limitations of each method—showing DEFLATE’s efficiency with repetitive data and Huffman coding’s behavior with randomized content. By the end, learners will gain an appreciation for the critical role of compression in reducing storage usage and optimizing data handling.
Digital Object Identifier (DOI)
10.5281/zenodo.16763292 (2025-08-01T16:25UTC)Launching this artifact will open it within Chameleon’s shared Jupyter experiment environment, which is accessible to all Chameleon users with an active allocation.
Download ArchiveDownload an archive containing the files of this artifact.