Search

Hayes equivalence is defined on monic polynomials over a finite field F q in terms of the prescribed leading coefficients and the residue classes modulo a given monic polynomial Q. We study the distribution of the number of zeros in a random polynomial over finite fields in a given Hayes equivalence class. It is well known that the number of distinct zeros of a random polynomial over F q is asymptotically Poisson with mean 1. We show that this is also true for random polynomials in any given Hayes equivalence class. Asymptotic formulas are also given for the number of such polynomials when the degree of such polynomials is proportional to q and the degree of Q and the number of prescribed leading coefficients are bounded by q. When Q = 1 , the problem is equivalent to the study of the distance distribution in Reed-Solomon codes. Our asymptotic formulas extend some earlier results and imply that all words for a large family of Reed-Solomon codes are ordinary, which further supports the well-known Deep-Hole Conjecture. [ABSTRACT FROM AUTHOR]

R. Gupta, P. Gahlyan and R.K. Sharma presented three classes of permutation trinomials over F q 3 in Finite Fields and Their Applications. In this paper, we employ the local method to prove that those polynomials are indeed permutation polynomials and provide their compositional inverses. [ABSTRACT FROM AUTHOR]