Math · Mathematical proceduresVISUAL DISCOVERY 389 OF 1,100
Kraft Inequality
Explorer · about 8 minutes · a little curiosity goes a long way
Browse all adventures
For grown-ups
Today’s little discovery
Kraft’s inequality says binary prefix-free code lengths satisfy a sum of 2 to each negative length at most 1. Each word occupies a disjoint subtree of the binary tree.
Ask your learner to point to the part that supports their answer about kraft inequality. For steps, powers, explain unfamiliar ideas together before using the model.
This is a learning model. Try the take-home activity together.Voice settings
Using Heart (en-US).
Saved voices download ahead of play for this activity. No lesson text is sent to a speech service.The sample plays once and does not change the Sound on/off setting.- Wonder
- Guess
- Try it
- Discover
- Celebrate
HERE’S A LITTLE WONDER…
What does kraft inequality reveal about kraft sum for n words of length n?
A precise sequence of operations transforms a starting mathematical object. Kraft’s inequality says binary prefix-free code lengths satisfy a sum of 2 to each negative length at most 1.
No rush. Try an idea and see.Open Lesson to read the question, choose your idea, and continue.