Right Circulant Matrices with Generalized Fibonacci and\ Lucas Polynomials and Coding Theory
Abstract
In this paper, we give two new coding algorithms by means of right circulant matrices with elements generalized Fibonacci and Lucas polynomials. For this purpose, we study basic properties of right circulant matrices using generalized Fibonacci polynomials Fp,q,n( x) , generalized Lucas polynomials Lp,q,n( x) and geometric sequences.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.