Pages that link to "Item:Q3028866"
From MaRDI portal
The following pages link to On the redundancy of optimal binary prefix-condition codes for finite and infinite sources (Corresp.) (Q3028866):
Displaying 7 items.
- On lower bounds for the redundancy of optimal codes (Q1273505) (← links)
- On the redundancy achieved by Huffman codes (Q1364502) (← links)
- On the size of transducers for bidirectional decoding of prefix codes (Q2889182) (← links)
- Optimal Prefix Codes for Pairs of Geometrically Distributed Random Variables (Q2989324) (← links)
- Existence of optimal prefix codes for infinite source alphabets (Q4392408) (← links)
- Optimal Prefix Codes And Huffman Codes (Q4464415) (← links)
- On the Expected Codeword Length Per Symbol of Optimal Prefix Codes for Extended Sources (Q4975805) (← links)