An efficient decoding technique for Huffman codes (Q1603588): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A memory-efficient and fast Huffman decoding algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Huffman decoding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Memory efficient and high-speed search Huffman coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Method for the Construction of Minimum-Redundancy Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Huffman codes and self-information / rank
 
Normal rank
Property / cites work
 
Property / cites work: The length of a typical Huffman codeword / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and analysis of dynamic Huffman codes / rank
 
Normal rank

Revision as of 11:48, 4 June 2024

scientific article
Language Label Description Also known as
English
An efficient decoding technique for Huffman codes
scientific article

    Statements

    An efficient decoding technique for Huffman codes (English)
    0 references
    0 references
    0 references
    0 references
    14 July 2002
    0 references
    0 references
    static Huffman code
    0 references
    data structures
    0 references
    complete binary tree
    0 references