Huffman coding with non-sorted frequencies (Q691643): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11786-011-0067-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2059312722 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identification Entropy / rank
 
Normal rank
Property / cites work
 
Property / cites work: String Processing and Information Retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4424240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust universal complete codes for transmission and compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Optimality of Huffman Trees / 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: On Information and Sufficiency / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of informational divergence to Huffman codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditions for Optimality of the Huffman Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2776217 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees / rank
 
Normal rank

Latest revision as of 23:20, 5 July 2024

scientific article
Language Label Description Also known as
English
Huffman coding with non-sorted frequencies
scientific article

    Statements

    Huffman coding with non-sorted frequencies (English)
    0 references
    0 references
    0 references
    3 December 2012
    0 references
    data compression
    0 references
    Huffman coding
    0 references
    partial sorting
    0 references
    dynamic compression
    0 references
    Burrows-Wheler transform
    0 references

    Identifiers