Live briefing
Everything about Canonical Huffman code
Standardized representation of a Huffman code
In computer science and information theory, a canonical Huffman code is a particular type of Huffman code with unique properties which allow it to be described in a very compact manner. Rather than storing the structure of the code tree explicitly, canonical Huffman codes are ordered in such a way that it suffices to only store the lengths of the codewords, which reduces the overhead of the codebook. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Canonical Huffman codeA 5-minute orientation
- Pick up a classic book: Mathematical structures for computer scienceThe most-reprinted book on the subject
- Read the landmark paper: FPGA implementation of high throughput encoder and decoder design of lossless canonical Huffman machineCited 9 times
- Go sideways: Huffman codingA closely related topic
- Go sideways: Shannon–Fano codingA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
FPGA implementation of high throughput encoder and decoder design of lossless canonical Huffman machine
A High-Throughput VLSI Architecture Design of Canonical Huffman Encoder
Energy-efficient canonical Huffman decoders on many-core processor arrays and FPGAs
ASIC Design of a Canonical Huffman Encoder for Computational Storage Drives
Canonical Huffman code based full-text index
Optimization of the canonical Huffman codes for word-based natural language text compression
đź“š Books worth reading
Mathematical structures for computer scienceJudith L. Gersting · 1982
Combinatorial pattern matchingSymposium on Combinatorial Pattern Matching (8th 1997 Aarhus, Denmark) · 1997
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Huffman coding 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…
- Shannon–Fano coding In the field of data compression, Shannon–Fano coding, named after Claude Shannon and Robert Fano, is one of two related techniques for constructing a…
- Bzip2 bzip2 is a file format and a file compression program. The program uses the Burrows–Wheeler algorithm to compress and decompress a single file using the…
- Tunstall coding In computer science and information theory, Tunstall coding is a form of entropy coding used for lossless data compression. Tunstall coding was the subject…
- Universal code (data compression) In data compression, a universal code for integers is a prefix code that maps the positive integers onto binary codewords, with the additional property…
- Arithmetic coding Arithmetic coding (AC) is a form of entropy coding used in lossless data compression. Normally, a string of characters is represented using a fixed number…
- Deflate In computing, Deflate (stylized as DEFLATE) is a lossless data compression algorithm that uses a combination of LZ77 and Huffman coding. It was designed…
- Range coding Range coding (or range encoding) is an entropy coding method defined by G. Nigel N. Martin in a 1979 paper, which effectively rediscovered the FIFO arithmetic…