Access by content of documents in an office information system
SIGIR '88 Proceedings of the 11th annual international ACM SIGIR conference on Research and development in information retrieval
Efficient decoding of prefix codes
Communications of the ACM
Generative models for bitmap sets with compression applications: (extended abstract)
SIGIR '91 Proceedings of the 14th annual international ACM SIGIR conference on Research and development in information retrieval
IEEE Transactions on Computers - Special issue on computer arithmetic
DNA Sequence Compression Using the Burrows-Wheeler Transform
CSB '02 Proceedings of the IEEE Computer Society Conference on Bioinformatics
Compression of Annotated Nucleotide Sequences
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A simpler analysis of Burrows–Wheeler-based compression
Theoretical Computer Science
Should one always use repeated squaring for modular exponentiation?
Information Processing Letters
The myriad virtues of Wavelet Trees
Information and Computation
Integer representation in the mixed base (2,3)
Cybernetics and Systems Analysis
Benchmarking the compression of XML node streams
DASFAA'10 Proceedings of the 15th international conference on Database systems for advanced applications
Interpolative coding of integer sequences supporting log-time random access
Information Processing and Management: an International Journal
Compression and learning in linear regression
ISMIS'11 Proceedings of the 19th international conference on Foundations of intelligent systems
Fast decoding algorithms for variable-lengths codes
Information Sciences: an International Journal
A simpler analysis of burrows-wheeler based compression
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
DNA compression challenge revisited: a dynamic programming approach
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Bridging lossy and lossless compression by motif pattern discovery
General Theory of Information Transfer and Combinatorics
Cybernetics and Systems Analysis
| Hi-index | 754.85 |
Families of Fibonacci codes and Fibonacci representations are defined. Their main attributes are robustness, manifesting itself by the local containment of errors; and simple encoding and decoding. The main application explored is the transmission of binary strings in which the length is in an unknown range, using robust Fibonacci representations instead of the conventional error-sensitive logarithmic ramp representation. Though the former is asymptotically longer than the latter, the former is actually shorter for very large initial segments of integers.