Robust transmission of unbounded strings using Fibonacci representations
- 1 March 1987
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 33 (2) , 238-245
- https://doi.org/10.1109/tit.1987.1057284
Abstract
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.Keywords
This publication has 10 references indexed in Scilit:
- Systems of NumerationThe American Mathematical Monthly, 1985
- On Universal Codeword SetsIEEE Transactions on Information Theory, 1981
- Linear Algorithm for Data Compression via String MatchingJournal of the ACM, 1981
- Maximal Prefix-Synchronized CodesSIAM Journal on Applied Mathematics, 1978
- Economical encoding of commas between stringsCommunications of the ACM, 1978
- An almost optimal algorithm for unbounded searchingInformation Processing Letters, 1976
- Universal codeword sets and representations of the integersIEEE Transactions on Information Theory, 1975
- Fibonacci codes for synchronization controlIEEE Transactions on Information Theory, 1965
- Generalized Fibonacci Numbers and Associated MatricesThe American Mathematical Monthly, 1960
- Synchronization of binary messagesIEEE Transactions on Information Theory, 1960