Coding theory on h(x) extension of m sequences for Fibonacci numbers

In this paper, we introduced h(x) extension of m sequences of Fibonacci numbers polynomials of order m and a new Sn matrix of order m where h(x)(> 0) is a polynomial with real coefficients. Thereby, we discuss various properties of Sn matrix and the Fibonacci coding theory followed from this matrix. We established the relations among the code matrix elements, error deduction and correction for this coding theory. In general, correct ability potential of this method increases and it is independent of h(x). But h(x) being a polynomial, improves the cryptography protection.