Pages that link to "Item:Q4392408"
From MaRDI portal
The following pages link to Existence of optimal prefix codes for infinite source alphabets (Q4392408):
Displaying 10 items.
- Practical algorithms for generating a random ordering of the elements of a weighted set (Q489756) (← links)
- New bounds on \(D\)-ary optimal codes (Q1044733) (← links)
- Infinite two-dimensional strong prefix codes: characterization and properties (Q1704099) (← links)
- Huffman-type codes for infinite source distributions (Q1804258) (← links)
- On the redundancy of optimal binary prefix-condition codes for finite and infinite sources (Corresp.) (Q3028866) (← links)
- The Universality of Grammar-Based Codes for Sources With Countably Infinite Alphabets (Q3547014) (← links)
- Optimal Prefix Codes And Huffman Codes (Q4464415) (← links)
- Optimal synchronous coding (Q4828660) (← links)
- On the Expected Codeword Length Per Symbol of Optimal Prefix Codes for Extended Sources (Q4975805) (← links)
- A combinatorial approach to Golomb forests (Q5941521) (← links)