More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding (Q5387768): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 0705.0253 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Code and parse trees for lossless source encoding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Codes: Unequal Probabilities, Unequal Letter Cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum '1'-ended binary prefix codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5831544 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary prefix codes ending in a "1" / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple proofs of some theorems on noiseless channels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coding with digits of unequal cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Huffman coding with unequal letter costs / 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: Optimal Alphabetic Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3280457 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Channels which transmit letters of unequal duration / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for constructing nearly optimal prefix codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable length tree structures having minimum average search time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mathematical Theory of Communication / rank
 
Normal rank

Latest revision as of 09:54, 28 June 2024

scientific article; zbMATH DE number 5279461
Language Label Description Also known as
English
More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding
scientific article; zbMATH DE number 5279461

    Statements

    More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding (English)
    0 references
    0 references
    0 references
    27 May 2008
    0 references

    Identifiers