Pages that link to "Item:Q2977298"
From MaRDI portal
The following pages link to Efficient and Compact Representations of Prefix Codes (Q2977298):
Displaying 14 items.
- Efficiency of chain codes to represent binary objects (Q877106) (← links)
- Efficient prefix coding of uncertainty spaces (Q1905215) (← links)
- Space-efficient Huffman codes revisited (Q2094355) (← links)
- Robust prefix encoding using lower \((2,3)\) number representation (Q2263249) (← links)
- A fast algorithm for adaptive prefix coding (Q2391182) (← links)
- On the size of transducers for bidirectional decoding of prefix codes (Q2889182) (← links)
- Fast and Compact Prefix Codes (Q3401107) (← links)
- (Q3465197) (← links)
- Fixed-prefix encoding of the integers can be Huffman-optimal (Q3489930) (← links)
- (Q3782815) (← links)
- Three space-economical algorithms for calculating minimum-redundancy prefix codes (Q4544663) (← links)
- Efficient and compact representations of some non-canonical prefix-free codes (Q5916286) (← links)
- Efficient and compact representations of some non-canonical prefix-free codes (Q5918490) (← links)
- Bounding the inefficiency of length-restricted prefix codes (Q5953598) (← links)