Pages that link to "Item:Q1917238"
From MaRDI portal
The following pages link to Robust universal complete codes for transmission and compression (Q1917238):
Displaying 12 items.
- Compressed matching for feature vectors (Q294934) (← links)
- Random access to Fibonacci encoded files (Q313776) (← links)
- The polytopic-\(k\)-step Fibonacci sequences in finite groups (Q659518) (← links)
- Huffman coding with non-sorted frequencies (Q691643) (← links)
- Should one always use repeated squaring for modular exponentiation? (Q963373) (← links)
- Compressed matching in dictionaries (Q1736479) (← links)
- Compror: On-line lossless data compression with a factor oracle. (Q1853024) (← links)
- Tunable multi-party high-capacity quantum key distribution based on \(m\)-generalized Fibonacci sequences using Golden coding (Q1991024) (← links)
- New compression schemes for natural number sequences (Q2112646) (← links)
- A space efficient direct access data structure (Q2397148) (← links)
- A simpler analysis of Burrows-Wheeler-based compression (Q2465054) (← links)
- Random Access to High-Order Entropy Compressed Text (Q2848976) (← links)
