Huffman encoding
Huffman encoding is a lossless prefix-coding technique that assigns variable-length codewords to symbols, with shorter codewords for more frequent symbols.
Grokking Algorithms, Second Edition
Huffman coding is a lossless compression algorithm that represents more frequent symbols with shorter variable-length codes.
- How it is used
- Uses Huffman coding to show how binary trees support lossless text compression.
- How deep it goes
- Works through character sizes and contrasting codes, but does not describe the algorithm for constructing a Huffman tree.
- Examples
- Compares codes for “tilt” and shows how an ambiguous assignment can give one bit sequence two readings.
- What you can do after
- Evaluate/understand how shorter codes can reduce bit counts and why decodable codes matter.
Read how Grokking Algorithms, Second Edition explains Huffman encoding →
Advanced Algorithms and Data Structures
Huffman coding is a lossless compression technique that represents symbols with variable-length prefix codes based on their frequencies.
- How it is used
- Builds a character-to-binary-sequence compression table from text frequencies.
- How deep it goes
- Explains frequency collection, min-heap merging, tree construction, and traversal, while deferring frequency-computation details.
- Examples
- Uses a six-character frequency table, a Huffman tree, and its resulting character-to-bit compression table.
- What you can do after
- Build it from scratch by combining frequency counts, a min-heap, a binary tree, and recursive table generation.
Read how Advanced Algorithms and Data Structures explains Huffman encoding →
Math and Architectures of Deep Learning
A prefix-coding method that builds variable-length codes from symbol frequencies to compress data efficiently.
- How it is used
- Uses variable-length coding to compress image pixels according to their frequency distribution.
- How deep it goes
- Explains prefix decoding and bit-count calculations, then connects compression effectiveness to entropy without deriving the construction algorithm.
- Examples
- Uses two 4 × 4 pixel-color images and compares fixed two-bit codes with variable codes.
- What you can do after
- Evaluate when variable-length coding improves image storage by comparing symbol frequencies, code lengths, and bits per pixel.
Read how Math and Architectures of Deep Learning explains Huffman encoding →
How Computers Make Books
Huffman encoding is a variable-length prefix coding technique that assigns shorter codewords to more frequent symbols.
- How it is used
- Compresses text by assigning variable-length bit codes and accounting for the tree sent alongside the message.
- How deep it goes
- Explains tree traversal, prefix-free codes, and compression totals, but defers how the tree is constructed.
- Examples
- Uses the code 110011 for “g”, a compressed sample message, and literary encoding and decoding exercises.
- What you can do after
- Practice/perform encoding and decoding with character frequencies, Huffman codes, and a code tree.
Read how How Computers Make Books explains Huffman encoding →
Related concepts
- frequency tableconfigured by · A frequency table is a mapping or tabulation that records the number or estimated number of occurrences for each item, value, category, or event.
- frequencyused by · Frequency is the count or rate at which an item, event, outcome, or periodic cycle occurs within a specified collection or interval.
- binary treeuses · A binary tree is a tree data structure in which each node has at most two children.
- compressionkind of · Compression is the transformation of information into a more compact representation to reduce storage or transmission requirements while retaining information needed for recovery or use.
- prefix codekind of · A prefix code is a code in which no valid code sequence is a prefix of another valid code sequence.
These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.