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

作　　者：DING Jian LI Hongju 

机构地区：[1]Department of General Education, Anhui Xinhua University

出　　处：《Chinese Journal of Electronics》2018年第1期46-51,共6页电子学报（英文版）

基　　金：supported by Anhui Province Natural Science Research(No.KJ2015A308,No.KJ2015JD18,No.KJ2016A307,No.KJ2017A623);Anhui Province Colleges Outstanding Young Talents Program(No.gxyq ZD2016389)

摘　　要：Based on the construction of a new distance-preserving Gray map from((F_p + uF_p)~N, Gray distance) to(the corresponding Gray images in F_p^(pN), Hamming distance) and the calculation of Gray distances of(u-1)-constacyclic codes over F_p + uF_p, a bound for the Hamming distances of a class of negacyclic codes with length p N over F_p 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.Based on the construction of a new distance-preserving Gray map from（（F_p ＋ uF_p）~N, Gray distance） to（the corresponding Gray images in F_p^（pN）, Hamming distance） and the calculation of Gray distances of（u-1）-constacyclic codes over F_p ＋ uF_p, a bound for the Hamming distances of a class of negacyclic codes with length p N over F_p 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.

关 键 词：Negacyclic code Hamming distance Gray distance Gray map 

分 类 号：TN[电子电信]