Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Fibonacci coding

Known as: Fibonacci code, Fibonacci encoding, Fibonacci representation 
In mathematics and computing, Fibonacci coding is a universal code which encodes positive integers into binary code words. It is one example of… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
The efficiency of any cryptographic algorithms depends on both security and operational speed. When a message is encrypted using… Expand
  • figure 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
2016
2016
We continue our study of the class of Fibonacci-automatic words. These are infinite words whose nth term is defined in terms of a… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
2015
2015
We implement a decision procedure for answering questions about a class of infinite words that might be called (for lack of a… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
2014
2014
In this paper we introduce a family of infinite words that generalize the Fibonacci word and we study their combinatorial… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • figure 3
Is this relevant?
2014
2014
We implement a decision procedure for answering questions about a class of infinite words that might be called (for lack of a… Expand
  • figure 1
  • table 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
2013
2013
David S. Simon,1,2 Nate Lawrence,2 Jacob Trevino,3 Luca Dal Negro,2,3,* and Alexander V. Sergienko2,4,† 1Department of Physics… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
2012
2012
For a binary word f, let Q"d(f) be the subgraph of the d-dimensional cube Q"d induced on the set of all words that do not contain… Expand
  • table 1
  • table 2
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Abstract We consider a new class of square Fibonacci ( p  + 1) × ( p  + 1)-matrices, which are based on the Fibonacci p -numbers… Expand
  • table 1
  • table 3
Is this relevant?
1991
1991
  • C. Frougny
  • IEEE Trans. Inf. Theory
  • 1991
  • Corpus ID: 35756533
Finite-state automata are used as a simple model of computation since only a finite memory is needed. The problem of passing from… Expand
Is this relevant?
1986
1986
Proof is given that no regular or synchronizable universal codeword sets can achieve optimality. Some asymptotic properties of a… Expand
Is this relevant?