Rings, polynomials and fields: revision of rings; quotient rings; polynomial rings and the Euclidean algorithm for polynomials; irreducible polynomials and factorisation of polynomials. fields; fields ...

This paper contains constructive generalizations to functions defined on spheres and projective spaces of the Jackson theorems on polynomial approximation.

This paper presents a generalization of the Remez multiple-exchange (ME) algorithm for solving complex Chebyshev approximation by polynomials on the unit circle. The difficulties of implementing the ...

[2] VLSI architecture of modified Euclidean algorithm for Reed–Solomon code. Information Sciences (2003). [3] List decoding of Reed–Solomon codes from a Gröbner basis perspective.