On the complexity of Fibonacci coding

DOI10.1134/S0032946018040038MaRDI QIDQ2278702zbMATH OpenOpenAlexFDO

Authors I. S. Sergeev

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

Mathematics Subject Classification ID

Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Switching theory, applications of Boolean algebras to circuits and networks (94C11)

Recommendations

• Fibonacci representations and finite automata
• scientific article; zbMATH DE number 3986648
• scientific article; zbMATH DE number 3875155
• Efficient algorithm for multiplication of numbers in Zeckendorf representation
• AUTOMATIC CONVERSION FROM FIBONACCI REPRESENTATION TO REPRESENTATION IN BASE φ, AND A GENERALIZATION

Cites work

• A Number System with an Irrational Base
• A simplified Binet formula for k-generalized Fibonacci numbers
• Efficient algorithms for Zeckendorf arithmetic
• Faster integer multiplication
• Fibonacci codes for synchronization control
• Generalized Fibonacci Numbers and Associated Matrices
• scientific article; zbMATH DE number 3859211 (Why is no real title available?)
• scientific article; zbMATH DE number 3947643 (Why is no real title available?)
• scientific article; zbMATH DE number 4012495 (Why is no real title available?)
• scientific article; zbMATH DE number 1408148 (Why is no real title available?)
• scientific article; zbMATH DE number 3322464 (Why is no real title available?)
• scientific article; zbMATH DE number 3076700 (Why is no real title available?)
• Optimal Size Integer Division Circuits
• Parallel addition in non-standard numeration systems
• Representation of Natural Numbers as Sums of Generalised Fibonacci Numbers
• Robust transmission of unbounded strings using Fibonacci representations

Cited in

(8)

• Robust transmission of unbounded strings using Fibonacci representations
• Fibonacci representations and finite automata
• scientific article; zbMATH DE number 3875155 (Why is no real title available?)
• scientific article; zbMATH DE number 1249178 (Why is no real title available?)
• scientific article; zbMATH DE number 493646 (Why is no real title available?)
• scientific article; zbMATH DE number 895329 (Why is no real title available?)
• Meta-Fibonacci Codes:Efficient Universal Coding of Natural Numbers
• Long range variations on the Fibonacci universal code

This page was built for publication: On the complexity of Fibonacci coding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2278702)