Robust transmission of unbounded strings using Fibonacci representations
From MaRDI portal
Recommendations
- On the complexity of Fibonacci coding
- Restricted binary strings and generalized Fibonacci numbers
- scientific article; zbMATH DE number 1472198
- High rates of Fibonacci polynomials coding theory
- Meta-Fibonacci Codes:Efficient Universal Coding of Natural Numbers
- Long range variations on the Fibonacci universal code
- Coding theory on Fibonacci n-step numbers
- A simple storage scheme for strings achieving entropy bounds
- A simple storage scheme for strings achieving entropy bounds
- Binary strings and reliability of path networks
Cited in
(19)- Integer representation in the mixed base (2,3)
- The use and usefulness of numeration systems
- Robust universal complete codes for transmission and compression
- New compression schemes for natural number sequences
- Generating (2,3)-codes
- The third order variations on the Fibonacci universal code
- On the complexity of Fibonacci coding
- The myriad virtues of wavelet trees
- A simpler analysis of Burrows-Wheeler-based compression
- Random access to Fibonacci encoded files
- Bridging Lossy and Lossless Compression by Motif Pattern Discovery
- Fast decoding algorithms for variable-lengths codes
- Two-base numeration systems
- Natural-Language Text Compression Using Reverse Multi-Delimiter Codes
- Lossless text compression by means of binary-coded ternary number representation
- Dense non-binary Fibonacci codes
- On integer sequences in cryptography
- Should one always use repeated squaring for modular exponentiation?
- Long range variations on the Fibonacci universal code
This page was built for publication: Robust transmission of unbounded strings using Fibonacci representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3030717)
