Pages that link to "Item:Q4053471"
From MaRDI portal
The following pages link to Optimal source codes for geometrically distributed integer alphabets (Corresp.) (Q4053471):
Displaying 9 items.
- Parallel lossless image compression using Huffman and arithmetic coding (Q671379) (← links)
- New bounds on \(D\)-ary optimal codes (Q1044733) (← links)
- Supporting random access in files of variable length records (Q1802061) (← links)
- Huffman-type codes for infinite source distributions (Q1804258) (← links)
- Universal coding for memoryless sources with countably infinite alphabets (Q2352641) (← links)
- Searching and encoding for infinite ordered sets (Q3933757) (← links)
- Optimal Prefix Codes And Huffman Codes (Q4464415) (← links)
- ASYMPTOTIC ANALYSIS OF OPTIMAL NESTED GROUP-TESTING PROCEDURES (Q5358095) (← links)
- A combinatorial approach to Golomb forests (Q5941521) (← links)