2009
DOI: 10.1016/j.chaos.2008.09.030
|View full text |Cite
|
Sign up to set email alerts
|

The generalized relations among the code elements for Fibonacci coding theory

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

1
35
0

Year Published

2009
2009
2019
2019

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 40 publications
(41 citation statements)
references
References 6 publications
1
35
0
Order By: Relevance
“…The approach presented is considered a Fibonacci-polynomial based coding method. Obviously, this is an extension of the results in [12] based on the Q n p matrices. By substituting a positive integer for x, an infinite number of matrices of order m ≥ 2 are obtained.…”
Section: Introductionmentioning
confidence: 59%
See 4 more Smart Citations
“…The approach presented is considered a Fibonacci-polynomial based coding method. Obviously, this is an extension of the results in [12] based on the Q n p matrices. By substituting a positive integer for x, an infinite number of matrices of order m ≥ 2 are obtained.…”
Section: Introductionmentioning
confidence: 59%
“…Parts of the p-Fibonacci sequences for p = 1, 2, 3, 4 are listed in the table below. The p-Fibonacci sequences have been used to construct coding and decoding matrices [12][13][14]. The Q p matrix of order p + 1 is introduced in [12].…”
Section: Introductionmentioning
confidence: 99%
See 3 more Smart Citations