The following pages link to (Q3688307):
Displaying 13 items.
- Compositions into powers of \(b\): asymptotic enumeration and parameters (Q308944) (← links)
- A note on r-extensible prefix codes (Q1114025) (← links)
- Complexity aspects of guessing prefix codes (Q1336967) (← links)
- On the size of transducers for bidirectional decoding of prefix codes (Q2889182) (← links)
- Canonical Trees, Compact Prefix-Free Codes, and Sums of Unit Fractions: A Probabilistic Analysis (Q2944462) (← links)
- Optimal Prefix Codes for Pairs of Geometrically Distributed Random Variables (Q2989324) (← links)
- (Q3465197) (← links)
- Existence of optimal prefix codes for infinite source alphabets (Q4392408) (← links)
- (Q4418601) (← links)
- On the Expected Codeword Length Per Symbol of Optimal Prefix Codes for Extended Sources (Q4975805) (← links)
- (Q5753876) (← links)
- Bounding the inefficiency of length-restricted prefix codes (Q5953598) (← links)
- Algorithmic counting of nonequivalent compact Huffman codes (Q6631554) (← links)