Right Circulant Matrices with Generalized Fibonacci and\ Lucas Polynomials and Coding Theory
From MaRDI portal
Recurrences (11B37) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Applications to coding theory and cryptography of arithmetic geometry (14G50) Determinants, permanents, traces, other special matrix functions (15A15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
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 , generalized Lucas polynomials and geometric sequences.
This page was built for publication: Right Circulant Matrices with Generalized Fibonacci and\ Lucas Polynomials and Coding Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6296052)
