|
gptkbp:instanceOf
|
gptkb:algorithm
data compression method
|
|
gptkbp:appliesTo
|
discrete memoryless sources
|
|
gptkbp:category
|
entropy encoding
|
|
gptkbp:complexity
|
O(n log n)
|
|
gptkbp:field
|
computer science
|
|
gptkbp:generalizes
|
adaptive Huffman coding
length-limited Huffman coding
n-ary Huffman coding
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Huffman coding
|
|
gptkbp:input
|
set of symbols with frequencies
|
|
gptkbp:inventedBy
|
gptkb:David_A._Huffman
1952
|
|
gptkbp:namedAfter
|
gptkb:David_A._Huffman
|
|
gptkbp:not_optimal_for
|
adaptive or unknown probabilities
|
|
gptkbp:optimal_for
|
known symbol probabilities
|
|
gptkbp:output
|
prefix code
|
|
gptkbp:property
|
no code is a prefix of another
|
|
gptkbp:purpose
|
lossless data compression
|
|
gptkbp:reduces
|
expected codeword length
|
|
gptkbp:relatedTo
|
gptkb:Shannon–Fano_coding
arithmetic coding
|
|
gptkbp:type
|
greedy algorithm
|
|
gptkbp:used_in
|
gptkb:DEFLATE
gptkb:GZIP
gptkb:JPEG
gptkb:MP3
PNG
|
|
gptkbp:uses
|
variable-length codes
|
|
gptkbp:bfsParent
|
gptkb:information_theory
|
|
gptkbp:bfsLayer
|
4
|