Pages that link to "Item:Q3030717"
From MaRDI portal
The following pages link to Robust transmission of unbounded strings using Fibonacci representations (Q3030717):
Displaying 18 items.
- Random access to Fibonacci encoded files (Q313776) (← links)
- Fast decoding algorithms for variable-lengths codes (Q424795) (← links)
- Two-base numeration systems (Q466398) (← links)
- Should one always use repeated squaring for modular exponentiation? (Q963373) (← links)
- Long range variations on the Fibonacci universal code (Q983294) (← links)
- Integer representation in the mixed base \((2,3)\) (Q1040415) (← links)
- The use and usefulness of numeration systems (Q1119959) (← links)
- Robust universal complete codes for transmission and compression (Q1917238) (← links)
- New compression schemes for natural number sequences (Q2112646) (← links)
- Generating \((2,3)\)-codes (Q2215868) (← links)
- The third order variations on the Fibonacci universal code (Q2254207) (← links)
- On the complexity of Fibonacci coding (Q2278702) (← links)
- The myriad virtues of wavelet trees (Q2389347) (← links)
- A simpler analysis of Burrows-Wheeler-based compression (Q2465054) (← links)
- Bridging Lossy and Lossless Compression by Motif Pattern Discovery (Q3439250) (← links)
- Natural-Language Text Compression Using Reverse Multi-Delimiter Codes (Q6495168) (← links)
- Lossless text compression by means of binary-coded ternary number representation (Q6495256) (← links)
- Dense non-binary Fibonacci codes (Q6660001) (← links)