Coding theory on Fibonacci n-step numbers
From MaRDI portal
Publication:2875682
Recommendations
- Fibonacci matrices, a generalization of the ``Cassini formula, and a new coding theory
- The generalized relations among the code elements for Fibonacci coding theory
- Tribonacci matrices and a new coding theory
- High rates of Fibonacci polynomials coding theory
- Coding theory on \(h(x)\) extension of \(m\) sequences for Fibonacci numbers
Cited in
(13)- \(k\)-order Gaussian Fibonacci polynomials and applications to the coding/decoding theory
- Combinatorial properties of Fibonacci partial words and arrays
- The Moore-Penrose inverse of the rectangular Fibonacci matrix and applications to the cryptology
- Tribonacci matrices and a new coding theory
- Meta-Fibonacci Codes:Efficient Universal Coding of Natural Numbers
- The generalized relations among the code elements for Fibonacci coding theory
- High rates of Fibonacci polynomials coding theory
- Robust transmission of unbounded strings using Fibonacci representations
- Fibonacci shift operation on Fibonacci numbers of order \(m\)
- Some Toeplitz-Hessenberg determinant identities for the tetranacci numbers
- On the decoding of 1-Fibonacci error correcting codes
- Companion matrices and golden-Fibonacci sequences
- Fibonacci matrices, a generalization of the ``Cassini formula, and a new coding theory
This page was built for publication: Coding theory on Fibonacci \(n\)-step numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2875682)