On Coding by ( 2, q ) -Distance Fibonacci Numbers

: In 2006, A. Stakhov introduced a new coding/decoding process based on generating matrices of the Fibonacci p -numbers, which he called the Fibonacci coding/decoding method. Stakhov’s papers have motivated many other scientists to seek certain generalizations by introducing new additional coefﬁcients into recurrence of Fibonacci p -numbers. In 2013, I. Włoch et al. studied ( 2, q ) -distance Fibonacci numbers F 2 ( q , n ) and found some of their combinatorial properties. In this paper, we state a new coding theory based on the sequence ( T q ( n )) ∞ n = − ∞ , which is an extension of Włoch’s sequence ( F 2 ( q , n )) ∞ n = 0 .


Introduction
Let (F n ) n≥0 be the sequence of Fibonacci numbers given by recurrence relation F n = F n−1 + F n−2 , for n ≥ 2, with initial conditions F 0 = 0 and F 1 = 1. These numbers possess many interesting and amazing properties (see [1,2] together with its very extensive annotated bibliography for additional references and history). For example, it is well-known that, for the Fibonacci numbers hold the following Binet's formula, where α := (1 + √ 5)/2 and β := (1 − √ 5)/2 are the roots of the characteristic equation The connection between the Fibonacci numbers and the Golden ratio α is similarly famous, which follows from Binet's formula and the relation |α| > |β| between the roots of characteristic polynomial f (x) = x 2 − x − 1. This limit was probably firstly studied by Johannes Kepler in 1619 (see English translation [3]) as he formulated there the approximation of the golden ratio α by the proportions of consecutive Fibonacci numbers.
In 1876, Lucas realized that Fibonacci numbers appear as the sums of the northeast diagonals in Pascal's triangle (see Figure 1), thus the following identity holds for any non-negative integer n In 1989, Stakhov [17] considered reformatted Pascal's triangle (see Table 1), where the sum of all numbers in the jth column, j ≥ 0, is equal to the Fibonacci number F j+1 .   · · · 1 6 · · · . . . He introduced, for any non-negative p, Fibonacci p-numbers, as sums of columns in a transformed Pascal's triangle (he denoted these triangles as Pascal's p-triangles), which is creating from Pascal's triangle by shifting all numbers in each row such way, that the first number in the ith row, i ≥ 0, is in the i(p + 1)th column. Stakhov showed that these Fibonacci p-numbers φ p (n) are given by the following recurrence relation On the fourth annual meeting of the Pacific Northwest Section of the Mathematical Association of America in 1950, Brenner [18] gave a lecture "Lucas' matrices" in which he presented usage of Fibonacci's matrix and Lucas' matrix 1 1 1 0 and α + β −αβ 1 0 , (5) and showed that their nth power are F n+1 F n F n F n−1 and U n+1 (a, b) U n (a, b) U n (a, b) U n−1 (a, b) , respectively, where (U n (a, b)) n≥0 is a non-degenerate Lucas sequence of the first kind (clearly F n = U n (1, 1)), defined, for any n ≥ 2, by the recurrence relation U n (a, b) = a U n−1 (a, b) + b U n−2 (a, b), with U 0 (a, b) = 0, U 1 (a, b) = 1 and a 2 + 4b = 0. Its characteristic equation x 2 − ax − b = 0 has discriminant D = a 2 + 4b and roots α = 1 2 (a + √ D), β = 1 2 (a − √ D), thus, for any n ≥ 0, the following generalized Binet formula holds U n (a, b) = α n − β n α − β .
The first matrix in (5) is usually called Fibonacci "Q-matrix", as King in his master's thesis [19] originated this notation (more on the history and some applications of Q-matrices can be found in [20,21]).
In 1999, Stakhov [22] introduced a new class of square matrices Q p of the order p + 1, where p is a non-negative integer, which are a generalization of Fibonacci Q-matrix He defined the Fibonacci p-numbers for integers n ≤ 0 by the different way then in (4), thus these Fibonacci p-numbers F p (n) are defined for positive integer p and any integer n by the following way Then, he showed that elements of Q p -matrices are connected to Fibonacci p-numbers by the following way In 2006, Stakhov [23] developed a theory of the Q p -Fibonacci matrices and he introduced a generalization of Cassini formula based on these matrices for any non-negative integers p, n > 0, as he proved that:

1.
For the nth power of matrix Q p holds: 2.
For the determinant of matrix Q p holds:

3.
For the inverse of Q n p the following extremely interesting identity holds: He also describes the original Fibonacci coding/decoding method based on the Q p Fibonacci matrix. Stakhov's discovery attracted much attention, and so many scientists have tried to more generalize this result. In 2009, Kocer et al. [24] generalized the Fibonacci p-numbers F p (n) by introducing a new parameter m and defined the m-extension of Fibonacci p-numbers, F p,m (n), by the following way where m is any positive real number. In 2009, Basu and Prasad [25] defined the matrix G p,m as a generalization of the matrix Q p , but there is a mistake in this paper, so we write the right form here, by the following way . Furthermore, they noted that G p,m can be written using m-extension of Fibonacci p-numbers F p,m (n), when we replace F p (n) by F m,p (n) in the matrix Q p in (8). Then, they showed that G p,m = (−1) p and that analogous identities as (9) and (10) hold for (G p,m ) n after replacing F p (n) by F m,p (n). In 2011, Tuglu et al. [26] and Basu et al. [27] (independently and in different notation) generalized m-extension of Fibonacci p-numbers to (m, t)-extension of Fibonacci numbers by the following way where m and t are any positive real numbers. They introduced the matrix G m,t,p as a generalization of the matrix Q p by the following way , which is again the matrix in the form (6), when we imagine F p (n) replaced by F m,t,p (n). Recently, many other papers that modify Stakhov's method in some way have been published (see, e.g., [28][29][30][31][32][33]). We showed that much effort was devoted to a different generalization of (4) by introducing some new coefficients in the Fibonacci p-numbers recurrence for the purpose to design a coding/decoding system in the last ten years. In this paper we will continue in the described direction of research aimed at possible generalizations of recurrence (4) for use in information security. In our generalization, we were motivated by the paper of Włoch et al. [34], which dealt with the combinatorial properties of the terms of the sequence (F 2 (q, n)) n≥0 , where q ≥ 1 and n > 0 are any integers, defined by the following recurrence with initial conditions F 2 (q, i) = 1 for i = 0, 1, . . . , q − 1. The authors called this sequence as the sequence of (2, q)-distance Fibonacci numbers. Clearly, Stakhov's p-Fibonacci numbers φ p (n) can be recalled as (1, p + 1)-distance Fibonacci numbers in this terminology. Probably independently, but four years later, the sequence with the recurrence (13) was studied in Deveci and Karaduman [35]. They called this sequence as Padovan p-sequence, as clearly it is generalization of Padovan sequence (P n ) n , considered q = p + 2 in (13); denoted this sequence as (Pap(n)) n ; and used the initial conditions Pap(i) = 0 for i = 1, 2, . . . , p and Pap(p + 1) = 1, Pap(p + 2) = 0. In this paper, to construct a new coding/decoding process, we first prove that the sequence (T q (n)) n has the Kepler limit for any odd integer q ≥ 3 (we prove the existence of dominant root of the characteristic polynomial of this sequence and we set a new criterion for test of "non-omitted root summand" in Binet-like formulas). Then, we construct the generating matrix of the sequence T q (n) in a different way than it was defined in the already mentioned Włoch's paper to be suitable for constructing a coding method. Further, we derive the relations among the code matrix elements, but our method is new and much simpler than the method introduced by Stakhov (the authors of all subsequent papers only took over his approach). Next, we discuss the correction ability of our encoding method and we show an example of concrete construction of coding/decoding system based on (2, 5)-distance Fibonacci numbers.

Auxiliary Results
For our main purpose, which is to design a coding/decoding system, we will need some known results, which we will only recall here, but also other auxiliary results, which we derive in this section.

Binet-Like Form of General Linear Recurrence
A fundamental result in the theory of recurrence sequences asserts that: Lemma 1. Let q be any positive integer, q > 1. Let (u n ) n be a linear recurrence sequence of the order q whose characteristic polynomial f (x) splits as where the λ j 's are distinct non-zero complex numbers and ∑ j=1 m j = q. Then, there exist uniquely determined polynomials g 1 , g 2 , . . . , g ∈ Q({λ j } j=1 )[x], with deg g j ≤ m j − 1 (m j is the multiplicity of λ j as zero of f (x)), for j ∈ [1, ], such that for all n holds u n = g 1 (n)λ n 1 + g 2 (n)λ n 2 + · · · + g (n)λ n .
The proof of this result can be found in [36], Theorem C.1, but we need only the following special case. Corollary 1. Let q be any positive integer, q > 1. Let a i and c i , i = 0, 1, . . . , q − 1, be any complex numbers. Let the sequence (u n ) n be defined by recurrence relation . . , λ q be any distinct non-zero roots of its characteristic polynomial f (x). Then, there exist uniquely determined complex numbers g 1 , g 2 , . . . , g q such that for all integers n holds u n = g 1 λ n 1 + g 2 λ n 2 + · · · + g q λ n q .
2.2. The Sequence F 2 (q, n) and Its Extension T q (n) The relation (3), which shows a connection between the Pascal's triangle and the Fibonacci sequence, led to the search for a connections of the Pascal's triangle with other linear recurrent sequences, which are a generalization of the Fibonacci sequence. Clearly, Stakhov's sequences (φ p (n)) n≥0 and (F p (n)) n≥0 , defined in (4) and (7), respectively, belong to these sequences, as the following holds for any integers Many mathematicians, working primarily in the field of combinatorics and discrete mathematics, began to deal with the other sequences which are a similar generalization of the Fibonacci sequence (see [34,[37][38][39][40][41][42][43][44][45]). In [34], the authors noted that from recurrence relation (13) of the sequence (F 2 (q, n)) n≥0 immediately follows that: • the sequence (F 2 (1, n)) n≥0 (thus the sequence of (2, 1)-distance Fibonacci numbers) coincides with the Fibonacci sequence (F n ) n≥0 ; • the sequence (F 2 (2, n)) n≥0 is the known sequence with powers of 2 which double up; and • for even q, the terms of the sequence (F 2 (q, n)) n≥0 satisfy the relation F 2 (q, 2n) = F 2 (q, 2n + 1) for any non-negative integer n (consequently, for even q, we can talk about "double" (2, q)-distance Fibonacci sequences).
Further, they showed that the sequence (F 2 (q, n)) n≥0 is connected to the Pascal's triangle too, as for any integers n ≥ 2, q ≥ 2 holds Next, they dealt with the companion matrix of the sequence (F 2 (q, n)) n≥0 , but for our purpose we find different generating matrices of this sequence that more closely match Stakhov's procedure for the sequence (F p (n)) n .
To use the sequence (F 2 (q, n)) n≥0 to design a coding and decoding system, we need to shift terms of the sequence (F 2 (q, n)) n one place left and extend the definition this sequence to all integers n in the following way (we denote this extended sequence as the sequence (T q (n)) n to simplify the notation in all subsequent text). Definition 1. Let q be any positive integer, q = 2, and let n be any integer. We define the (2, q)-distance Fibonacci numbers T q (n) by The sequence of integers in (18) is clearly a generalization of Fibonacci numbers as recurrence (18) would define for q = 1 and q = 3 exactly the sequence of Fibonacci numbers F n and Padovan numbers P n for any integer n, respectively (see Table 2). Table 2. Values T q (n) for q = 1, 3, 4, 5, 6, 7, 8, 9 and −8 ≤ n ≤ 10.
Firstly, we prove an elementary fact for the sequence (T q (n)) n , which we need for proof of some special cases in our main theorem.

The Generalized Kepler Limit of T q (n)
In this section, we prove that the sequence (T q (n)) n has the Kepler limit for any odd integer q ≥ 3. It is well known that the existence of the Kepler limit is related to the existence of a dominant root between the roots α 1 , α 2 , . . . , α q of the characteristic polynomial of (T q (n)) n (namely that there exists a root α q such that |α q | > |α j | for every j = q) (see, e.g., [46,47]). It is less known that the existence of a dominant root is not a sufficient condition for the existence of the Kepler limit. Fiorenza and Vincenzi [48,49] addressed this problem and formulated a number of examples of problematic initial conditions, but they have not found any criteria, which we will do here.
For this purpose, we need to show two facts: • the characteristic polynomial f q (x) of the sequence (T q (n)) n has a dominant root α q ; and • the summand, containing the power of the dominant root α q , is actually occurred among the summands in the Binet-like formula of (2, q)-distance Fibonacci numbers.
Theorem 1. Let q > 2 be any integer. Let f q (x) denote the characteristic polynomial of the sequence (T q (n)) n , thus f q (x) = x q − x q−2 − 1. Then, (i) f q (x) does not have multiple roots; and (ii) f q (x) has a dominant root for all positive odd integers q > 1.
Proof. Case (i) was proved in [35], thus we prove Case (ii) only. By the Descartes' sign rule, we have the existence of only one positive real root α of f q (x). In fact, On the other hand, by the triangle inequality, we have |z q | ≤ |z q−2 | + 1 and so |z q | = |z q−2 | + 1. Thus, 1, z q−2 and z q become to the same ray. This implies that there exists a real number t 0 such that z q = 1 + t 0 (z q−2 − 1). Since z q = z q−2 + 1, we deduce that |z| = α and also that z q−2 /(z q−2 − 1) = t 0 is a real number and so is z q−2 . It follows that z q is also a real number and moreover, z q−2 and z q are both positive (because the relation z q = z q−2 + 1 together with the fact that |z| > 1). Now, since z 2 = z q /z q−2 > 0, then z is a nonzero real number. However, z is not negative, since in this case z q would be also negative (since q is odd). Thus, z is a positive real number which is a root of f q (x) which yields that z = α (since α is the only positive real root of f q (x)). This completes the proof.

Remark 1.
In Theorem 1, we have proved that the dominant root exists for odd q. It is easy to realize that for even q, due to the same parity of numbers q and q − 2, the characteristic polynomial f q (x) cannot have a dominant root, because if α is its root, then its root is also −α. Now, we formulate the general criterion for "non omitted root summand" in Binet-like formula of the sequence (u n ) n . Theorem 2. Let q be any positive integer, q > 1. Let the sequence (u n ) n be defined by a linear recurrence of order q by (15), whose characteristic polynomial f (x) has distinct non-zero roots λ 1 , λ 2 , . . . , λ q . If determinant of the following matrix U q,n Proof. Using Binet-like form for the linear recurrence (u n ) n , given by (16), we can write the matrix U q,n as and using additive property of determinants with only one distinct column we can write determinant |U q,n | as sum of q q determinants, but q q − q! determinants is clearly zero as they have at least two columns created by powers of the same root λ i , i = 1, 2, . . . , q. Thus, where S n is the symmetric group on elements 1, 2, . . . , n. Then, we can write where V(λ i 1 , λ i 2 , . . . , λ i q ) are Vandermonde determinants.
By Theorems 1, 2, and 3 (ii) and Corollary 1, we can write a (2, q)-distance Fibonacci sequence (T q (n)) n in its asymptotic form T q (n) = g q α n q (1 + o(1)), where α q is the dominant root of the sequence (T q (n)) n , g q is a nonzero constant and o(1) is a function which tends to 0 as n → ∞. Hence the following holds Corollary 2. Let q be any odd integer, q ≥ 3, let be any positive integer. Then, there is a so-called generalized Kepler limit where α q is the dominant root of the sequence (T q (n)) n .

Generating Matrices of T q (n)
We showed that Q-matrix, which generates the Fibonacci sequence, was already constructed for many kinds of generalized Fibonacci sequences. Now, we would like to note that these generating matrices can be created in slightly different forms (usually based on certain rearrangements of the indices of the studied sequence), e.g., we can find more than ten forms of generating matrices of Padovan sequence in papers [50][51][52][53][54]. Similarly, in [34,35], the authors constructed generating matrices of the sequence (F 2 (q, n)) n and (Pap(n)) n , respectively, but, to apply the extended sequence (T q (n) n for encoding and decoding, we consider another form of generating matrix, we denote it by R q , whose nth power, denoted by M q,n , corresponds to the form of the matrix obtained by Stakhov in (9).

Definition 2.
Let q be any positive integer, q ≥ 3, and let n be any integer. Let M q,n = (m i,j (q, n)) 1≤i,j≤q , where thus, M q,n is equal to

Example 1.
Let us consider n = 4 and q = 3 (see Table 2). Then, the matrix M q,4 has the following special form Lemma 3. Let q be any positive integer, q ≥ 3. The matrix M q,4 = (m i,j (q, 4)) 1≤i,j≤q , has the following special form Proof. By (20) M q,4 is equal to and using Lemma 2 and with respect to Example 1 we get the assertion.

Lemma 4. Let a be any positive integer. Let A denote a matrix such that
1 −1 1 · · · · · · −1 1 −1 −1 1 −1 · · · · · · 1 −1 1 1 −1 1 · · · · · · −1 1 −1 − Then, (i) A is a Toeplitz matrix (thus, a diagonal-constant matrix). (ii) Every element on the main diagonal of A is 1 and all adjacent diagonals have opposite signs. (iii) The addition of the ith row to the (i + 1)th row is equal to the zero vector. (iv) The addition of the first row and the last row is equal to the zero vector.

Proof. The proof is trivial by the definition of matrix A.
Theorem 3. Let q be any positive integer, q ≥ 3, and let n be any integer. Then, the following hold (i) M q,n = R q · M q,n−1 , where R q = (r i,j ) 1≤i,j≤q , with thus M −1 q,4 is equal to

Proof.
Proof of (i). We compute the product of matrices R and M q,n−1 , thus Case 3 Let i = q. Then, (R q · M q,n−1 ) q,j = r q,1 · m 1,j (q, n − 1) = m 1,j (q, n − 1), Thus, we show that M q,n = R q · M q,n−1 for any integer n.
Proof of (ii). By item (i), we have M q,n = R n−4 q · M q,4 for any positive integer n > 4 (similarly it holds M q,n = R n q · M q,0 , for any positive integer n, but the matrix M q,0 is not as simple as matrix M q,4 ).
We calculate the determinant of the matrix M q,n with the help of identity (22), i.e., firstly we find the determinant of the matrix R and then the determinant of the matrix M q,4 .
Determinant of the matrix R q We use the Laplace theorem. We expand the determinant of matrix R along the first column, thus det R q = (−1) q+1 · 1 0 · · · · · · 0 1 0 where we use the fact that the resulting matrix is an upper triangular matrix. Determinant of the matrix M q, 4 We again use the Laplace theorem and we expand it along the last row, thus det M q,4 = (−1) q+1 where we use the fact that the last two resulting matrices are triangular matrices with the main diagonal containing only ones.
Finally, using well-known formula for determinant of product of matrices, we have by (22) Proof of (iii). Let us denote by R q = ( r i,j ) 1≤i,j≤q a matrix such that Thus, we wish to prove that R q · R q = R q · R q = I q . To avoid unnecessary repetition, we prove only that R q · R q = I q . Thus, we must prove for 1 ≤ i, j ≤ q that We split the proof of (iii) into the following cases Case 3 Let i > 2. Then, Thus, R coincides with the inverse matrix R −1 of the matrix R.
Proof of (iv). Assuming that q is even (thus, let q = 2a, where a ≥ 2 is any integer), the proof is analogous for odd k. We show that the matrix M 2a,4 defined by (21), with q = 2a, is the inverse matrix to the matrix M 2a, 4 . We have that M 2a,4 = ( m i,j ) 1≤i,j≤2a , with It is clear that the matrix M 2a,4 arises from the matrix A, defined in Lemma 4, on the basis of change the element in the position (2, 2a) to 2 and the "triangle of elements in the center part" to 0. The matrix A is a Toeplitz matrix (thus, diagonal-constant matrix) with the main diagonal with the plus signs and side by side diagonals with opposite signs. Hence, the addition of any side by side rows leads to the zero vector. Therefore We split the proof of (25) to the following cases Case 1 Let i = 1. By Lemma 4 (c) and as m 3, 0, otherwise .

Coding/Decoding System Based on (2, q)-Distance Fibonacci Numbers
Let us consider that we have a message M (represented by a string of digits), which we want to secretly send to a certain unique recipient through a communication channel. There are various methods for this secret transmission of a message M, but, in this paper, we deal with only one of these methods based on matrix multiplication. For this reason we rewrite the original message M by grouping of its digits to elements of a matrix M = (m q(i−1)+j ) 1≤i,j≤q of order q, q > 2 is an integer (in this step, we have many possibilities, so we use such grouping to be matrix M a non-singular matrix), which we want to transform into a code matrix E = (e q(i−1)+j ) 1≤i,j≤q (this transformation is called coding process) and send it to the recipient. We can use an invertible matrix M as a coding matrix and its inverse M −1 as a decoding matrix, thus we get the code matrix E = M · M with coded original message M (if we rewrite elements of matrix E as the string of digits, we get the coded message E). Then, we can decode E by using the inverse matrix M −1 , thus E · M −1 = M (this transformation is called decoding process).
To design a fully functional coding/decoding process based on matrix multiplication Stakhov [23] defined the matrix M on the base of terms of the sequence (F p (n)) n (defined in (7)), we set M := Q n p (see identity (9)) and propose the following requirements: (i) There is the Kepler limit for the sequence of Fibonacci p-numbers F p (n), which allows an error detection and correction. (ii) Determinant of the matrix Q n p needs to be ±1, as we want all entries of the inverse matrix (Q n p ) −1 to be integers. Further, determinant |Q n p | plays a role of the "checking element" in the coding process, as it is sent immediately after the coded message through the transmission channel.
In previous sections, we construct the sequence of the matrices M q,n = (m i,j (q, n)) 1≤i,j≤q based on the (2, q)-distance Fibonacci numbers T q (n) and now we show that matrices M q,n = (m i,j (q, n)) 1≤i,j≤q can be used effectively in coding/decoding process. Clearly, our sequence of (2, q)-distance Fibonacci numbers T q (n), with an odd value of q > 2, fulfills the previous Stakhov's Requirements (i) and (ii), as, by Corollary 2 we know, that the sequence (T q (n)) n satisfies the generalized Kepler limit with the dominant root α q , for any odd q ≥ 3, and by Theorem 3 determinant of the matrix M q,n is equal to 1, respectively.
Hence, we can use matrix M q,n as a coding matrix and its inverse M −1 q,n as a decoding matrix and we get the code matrix E = M · M q,n with coded original message M. Then, we can decode E by using the inverse matrix M −1 q,n , thus E · M −1 q,n = M. With respect to Theorem 3, we can use in decoding process these facts: • For an odd q ≥ 3, we have |M q,n | = 1, thus the "checking element" if an error occurs during transmission in coding process is very suitable as |E| = |M| must be satisfied.

•
For finding the message matrix M from the code matrix E, we have the following computationally much faster way

Relation among Code Matrix Elements and Code Rate of This Method
When a message is transmitted from a sender to a recipient, the message may be distorted in the communication channel. Hence, some errors can occur in the code matrix E and we must be able to identify these errors and subsequently correct them. We show that the basis of an error detection as well as its correction is the value of the determinant |E| and the following relation among elements of code matrix E. Lemma 5. Let q be any integer, q ≥ 3, let , k be any positive integers, < q and k ∈ [1, q 2 ], k ≡ 0, 1, . . . , − 1 (mod q). Let α q be the strict dominant root of the sequence (T q (n)) n . Then, for elements of the matrix E holds lim n→∞ e k e k+ = α q .
Proof. With respect to defining identity (20) of the matrix M q,n = (m i,j (q, n)) 1≤i,j≤q the following statements immediately hold: The jth column C j , j ∈ [1, q], of M q,n consists of elements of the set {T q (n − j − r); r ∈ [0, q − 1]}, has as its first element T q (n − j) and the others are arranged in descending order according to the index in round brackets. Thus, it has the form C j = (T q (n − j), T q (n − j − (q − 1)), T q (n − j − (q − 2)), . . . , T q (n − j − 1)) T .
As E = M · M q,n , we get elements of the code matrix E = (e q(i−1)+j ) 1≤i,j≤q with respect to the previous Statements (b) and (c) by the following way Now, we prove the case for = 1. When we denote k := q(i − 1) and with respect to Corollary 2 Cases for 1 < < q.
Let us consider that we send by the communication channel the code matrix E and right after the determinant |M| of the message matrix M. As already mentioned, determinants of the message matrix |M| and the code matrix |E| are equal in our case; thus, clearly, by comparing the determinant of the matrix obtained by the recipient from the communication channel with the value of determinant |M|, the recipient can decide whether the code matrix |E| is damaged or not, but he cannot determine which element of the code message is damaged. To find the damaged element (or more elements), the recipient necessarily needs both the value of the determinant and the approximation properties among elements of code matrix |E|, which we found in Lemma 5.
It is possible to show, the same way as done, e.g., in [23,55], that by these properties can be corrected all cases except for the case with all error elements of the code matrix M, namely ( q 2 1 ) cases with one error element, ( q 2 2 ) cases with any two error elements, ( q 2 3 ) cases with any three error elements, . . . , ( q 2 q 2 −1 ) cases with (q 2 − 1) error elements. Thus, the correction ability S cor of this coding/decoding method is done by the formula

Example of Coding/Decoding by Matrix Based on (2, 5)-Distance FIBONACCI Numbers
Now, we consider the special case of our method for q = 5 (the case for q = 3, thus based on the sequence of Padovan numbers (P n ) n , is separately discussed, e.g., in [54], and for q = 4 our sequence T 4 (n) does not have the dominant root, with respect to Theorem 1). Therefore, we represent the initial message M by the matrix M = (m 5(i−1)+j ) 1≤i,j≤5 , thus for which with respect to (22)  Using the previous identity, we get easily the following two identities (for simplification of notation, we write t n := T 5 (n) in the rest of the text). For the code matrix E = (e 5(i−1)+j ) 1≤i,j≤5 , thus We easily can show that the previous identity for R n−4 5 holds for any integer n, thus we can write for any integer n. Hence, where If we denote v n := t n−2 − t n−5 + 2(t n−4 − t n−3 ) we get by (28) and (30)  In this case, we get the following form of relation among code matrix elements and code rate of this coding/decoding method by Lemma 5.

Conclusions
In this paper, we are interested in construction of a new coding/decoding system based on the sequence (T q (n)) n , which is the extension of (2, q)-distance Fibonacci numbers introduced by Włoch et al. [34]. We show that the coding/decoding process can be based on sequences of a higher type than (1, q)-distance Fibonacci numbers, which was used in all previous papers, which immediately leads to the conclusion that our method significantly expands the group of currently used methods. Our proposal thus reduces the probability of an error due to noise or intentional modification of the message by a person who would enter the transmission channel without permission. Our research was motivated by Stakhov [23], who introduced the construction of so-called Fibonacci coding method.
His paper aroused great interest among many mathematicians who have designed their own encoding systems, mostly constructed on the basis of certain generalizations by introducing new additional coefficients into p + 1 order linear recurrence of Stakhov's Fibonacci p-numbers. All of these papers contain the full construction of the coding system based on matrix multiplication, but they contain one very significant gap, as their authors only assumed the existence of the dominant root of the generalized Fibonacci p-numbers and polynomials, but did not prove their existence. Therefore, we first prove that our sequence (T q (n)) n has a dominant root for every odd integers q ≥ 3 and that the criterion for "non omitted root summand" in Binet-like formula, what is used for the proof of existence of the generalized Kepler limit. Then, we construct a new type of generating matrix of the sequence (T q (n)) n by a new way to be more suitable for constructing of the coding/decoding method. We find the general relations among the code matrix elements E, which are analogous with the relations founded in previous papers, but our method is new and much simpler than the method introduced by Stakhov and replicated by his followers (see, e.g., [55]). Finally, we discuss the correction ability of our coding/decoding method and we construct an example of concrete coding/decoding system based on (2, 5)-distance Fibonacci numbers T 5 (n).