The Hamming Distances of a Class of p-Ary Negacyclic Codes

Based on the construction of a new distance-preserving Gray map from(（F;+ uF;）;, Gray distance) to(the corresponding Gray images in F;, Hamming distance) and the calculation of Gray distances of（u-1）-constacyclic codes over F;+ uF;, a bound for the Hamming distances of a class of negacyclic codes with length p N over F;is obtained, which is more tighter than Singleton bound. Further more, the exact Hamming distances of some p-ary negacyclic codes are determined from this bound, some of which cannot be got from Dinh’s work published on Finite Fields and Their Applications in 2008.