On the generalized Fibonacci sequence of polynomials over finite fields
From MaRDI portal
Abstract: In this paper, as an analogue of the integer case, we study detailedly the period and the rank of the generalized Fibonacci sequence of polynomials over a finite field modulo an arbitrary polynomial. We establish some formulas to compute them, and we also obtain some properties about the quotient of the period and the rank. We find that the polynomial case is much more complicated than the integer case.
This page was built for publication: On the generalized Fibonacci sequence of polynomials over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6431467)
