On the complexity of Fibonacci coding
From MaRDI portal
Publication:2278702
DOI10.1134/S0032946018040038zbMath1471.94038OpenAlexW2913750612MaRDI QIDQ2278702
Publication date: 10 December 2019
Published in: Problems of Information Transmission (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0032946018040038
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Switching theory, applications of Boolean algebras to circuits and networks (94C11)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel addition in non-standard numeration systems
- Efficient Algorithms for Zeckendorf Arithmetic
- Robust transmission of unbounded strings using Fibonacci representations
- A Number System with an Irrational Base
- Generalized Fibonacci Numbers and Associated Matrices
- Optimal Size Integer Division Circuits
- Faster Integer Multiplication
- A simplified Binet formula for k-generalized Fibonacci numbers
- Fibonacci codes for synchronization control
- Representation of Natural Numbers as Sums of Generalised Fibonacci Numbers
This page was built for publication: On the complexity of Fibonacci coding