This is a submission for DEV Computer Science Challenge v24.06.12: One Byte Explainer.
Explainer
Data compression is reducing bits needed to represent data.
S:she sees sea-needs 80bits(8bits/char).
If
-
only 3 words(
she,sees,sea) exist, S:"00 01 10"-6bits - all alphabets exist & S is only sentence, S:"1 001 01 1 01 01 1 1 01 000"(Huffman coding)-18bits.
Additional Context
In computer science and information theory, a Huffman code is a particular type of optimal prefix code that is commonly used for lossless data compression. The process of finding or using such a code is Huffman coding, an algorithm developed by David A. Huffman while he was a Sc.D. student at MIT, and published in the 1952 paper "A Method for the Construction of Minimum-Redundancy Codes".
Top comments (0)