The weight distributions of irreducible cyclic codes of length 2npm

Abstract

Let [Formula: see text] be a primitive root modulo [Formula: see text], where [Formula: see text] and [Formula: see text] are distinct odd primes. Let [Formula: see text] be a finite field. For such pair of [Formula: see text] and [Formula: see text], the explicit expressions of minimal and generating polynomials over [Formula: see text] are obtained for all irreducible cyclic codes of length [Formula: see text]. In Sec. 4, it is observed that the weight distributions of all irreducible cyclic codes of length [Formula: see text] over [Formula: see text] can be computed easily with the help of the results obtained in [P. Kumar, M. Sangwan and S. K. Arora, The weight distribution of some irreducible cyclic codes of length [Formula: see text] and [Formula: see text], Adv. Math. Commun. 9 (2015) 277–289]. An explicit formula is also given to compute the weight distributions of irreducible cyclic codes of length [Formula: see text] over [Formula: see text].