Pages that link to "Item:Q5953598"

The following pages link to Bounding the inefficiency of length-restricted prefix codes (Q5953598):

Displaying 21 items.

• Colored range queries and document retrieval (Q390874) (← links)
• On compressing permutations and adaptive sorting (Q391981) (← links)
• Exact and approximation algorithms for error-detecting even codes (Q441883) (← links)
• A note on the construction of error detecting/correcting prefix codes (Q963391) (← links)
• A note on r-extensible prefix codes (Q1114025) (← links)
• Complexity aspects of guessing prefix codes (Q1336967) (← links)
• Trading off worst and expected cost in decision tree problems (Q1679235) (← links)
• On the ratio of prefix codes to all uniquely decodable codes with a given length distribution (Q1752605) (← links)
• Efficient prefix coding of uncertainty spaces (Q1905215) (← links)
• On the proportion of prefix codes in the set of three-element codes (Q2185934) (← links)
• The WARM-UP algorithm: A Lagrangian construction of length restricted Huffman codes (Q2706116) (← links)
• On the size of transducers for bidirectional decoding of prefix codes (Q2889182) (← links)
• On the redundancy of optimal binary prefix-condition codes for finite and infinite sources (Corresp.) (Q3028866) (← links)
• Worst-Case Optimal Adaptive Prefix Coding (Q3183465) (← links)
• Existence of optimal prefix codes for infinite source alphabets (Q4392408) (← links)
• (Q4508379) (← links)
• Three space-economical algorithms for calculating minimum-redundancy prefix codes (Q4544663) (← links)
• On the cost of worst case coding length constraints (Q4544758) (← links)
• Parity codes (Q4680739) (← links)
• On the Expected Codeword Length Per Symbol of Optimal Prefix Codes for Extended Sources (Q4975805) (← links)
• Efficient and compact representations of some non-canonical prefix-free codes (Q5916286) (← links)