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

本文刊于:《Chinese Journal of Electronics》 2018年第1期

Negacyclic code;Hamming distance;Gray di

Negacyclic code;Hamming distance;Gray distance;Gray map
     Based on the construction of a new distance-preserving Gray map from((Fp + uFp)N, Gray distance) to(the corresponding Gray images in FppN, Hamming distance) and the calculation of Gray distances of(u-1)-constacyclic codes over Fp + uFp, a bound for the Hamming distances of a class of negacyclic codes with length p N over Fp 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.


上一篇:Bird-Carreau型黏性van der Waals流体周期解的渐近稳定性

分享到: 分享The Hamming Distances of a Class of p-Ary Negacyclic Codes到腾讯微博           收藏