On the redundancy achieved by Huffman codes (Q1364502): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Tight upper bounds on the redundancy of Huffman codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds on the redundancy of Huffman codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the redundancy of Huffman codes (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the redundancy achieved by Huffman codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variations on a theme by Huffman / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved bound for weight-balanced tree / 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: On the redundancy of binary Huffman codes (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Huffman codes and self-information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds on the redundancy of Huffman codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the redundancy of optimal binary prefix-condition codes for finite and infinite sources (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the average codeword length of optimal binary codes for extended sources (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3358644 / rank
 
Normal rank

Latest revision as of 18:35, 27 May 2024

scientific article
Language Label Description Also known as
English
On the redundancy achieved by Huffman codes
scientific article

    Statements

    On the redundancy achieved by Huffman codes (English)
    0 references
    0 references
    0 references
    4 September 1997
    0 references
    0 references
    Huffman codes
    0 references
    redundancy
    0 references
    discrete memoryless source
    0 references
    0 references