**FINITE FIELD FACTORIZATION OF POLYNOMIALS**

The development and design of many practical applications involving digital sequences require the factorization of polynomials. In particular, a cyclic code or a similar mathematical structure requires the factorization of *x ^{n}* + 1 as a product of irreducible polynomials with roots in a finite field, where

Let again the factorization derived in Theorem 5.4 be considered, i.e.,

In (6.1) *V _{d}*(

Start Free Trial

No credit card required