Institute of Mathematics and Informatics Bulgarian Academy of Sciences
Serdica Journal of Computing, Vol. 2, No 2, (2008), 105p-110p
Constacyclic codes with one and the same generator polynomial and distinct length are considered. We give a generalization of the previous result of the first author  for constacyclic codes. Suitable maps between
vector spaces determined by the lengths of the codes are applied. It is proven
that the weight distributions of the coset leaders don’t depend on the word
length, but on generator polynomials only. In particular, we prove that every
constacyclic code has the same weight distribution of the coset leaders as a
suitable cyclic code.