Surya Prakash Sahu
Posted on
Data Compression: Under 256 characters
This is a submission forDEV 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:"000110"-6bits - all alphabets exist & S is only sentence, S:"100101101011101000"(Huffman coding)-18bits.
Additional Context
In computer science and information theory, aHuffman 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 isHuffman 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)
Subscribe
For further actions, you may consider blocking this person and/orreporting abuse
