liveBook · Manning

Compression table

As explained in Advanced Algorithms and Data Structures

A compression table is a mapping from characters to the bit sequences assigned by a compression code.

A compression table maps each character to the bit sequence assigned by a Huffman coding tree. Compressing text then translates every character through this mapping. section 2.8.3

A concrete table

For the displayed frequency distribution, the table assigns A → 0, B → 10, C → 1100, D → 1101, E → 1110, and F → 1111.

How Advanced Algorithms and Data Structures covers it

How deep it goes
Explains recursive construction from tree paths and leaves, while leaving final bit-output encoding outside the treatment.
Examples
Uses a six-character frequency table and its resulting A-through-F bit assignments.
What it assumes
Assumes familiarity with character frequencies, tree nodes, and priority queues while demonstrating table construction from the resulting tree.
What you can do after
Build it from scratch by recursively traversing a Huffman tree and storing each leaf’s root-to-leaf bit sequence.
How it connects
Connects Huffman coding with binary trees, priority queues, min-heaps, and recursive tree traversal.
Cover of Advanced Algorithms and Data Structures
liveBookmanning.com
Read Advanced Algorithms and Data Structures on liveBook Get the book at manning.com

This explainer was generated by Manning's knowledge graph from the text of Advanced Algorithms and Data Structures. The section links point to the parts of the book it draws on.