DEV Community

Surya Prakash Sahu
Surya Prakash Sahu

Posted on

Data Compression: Under 256 characters

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".

Heroku

This site is built on Heroku

Join the ranks of developers at Salesforce, Airbase, DEV, and more who deploy their mission critical applications on Heroku. Sign up today and launch your first app!

Get Started

Top comments (0)

Sentry image

See why 4M developers consider Sentry, “not bad.”

Fixing code doesn’t have to be the worst part of your day. Learn how Sentry can help.

Learn more

👋 Kindness is contagious

Please leave a ❤️ or a friendly comment on this post if you found it helpful!

Okay