Robust transmission of unbounded strings using Fibonacci representations
IEEE Transactions on Information Theory
Linear Fibonacci Forms and Parallel Algorithms for High Dimension Arithmetic
PaCT '95 Proceedings of the 3rd International Conference on Parallel Computing Technologies
Fast Decoding of Fibonacci Encoded Texts
DCC '07 Proceedings of the 2007 Data Compression Conference
Variable-length Codes for Data Compression
Variable-length Codes for Data Compression
Using Fibonacci Compression Codes as Alternatives to Dense Codes
DCC '08 Proceedings of the Data Compression Conference
Integer representation in the mixed base (2,3)
Cybernetics and Systems Analysis
On the Usefulness of Fibonacci Compression Codes
The Computer Journal
Variable-length integer codes based on the Goldbach conjecture, and other additive codes
IEEE Transactions on Information Theory
Universal codeword sets and representations of the integers
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
Two-base numeration systems are introduced in the paper. They are generalizations of standard numeration systems, which are based on powers of a given radix. The results are reviewed and applications for encoding numbers and trees are given. Further research fields are outlined. A new parallel algorithm for modular exponentiation and new classes of prefix codes are presented.