We investigate negacyclic codes over the Galois ring GR(2a,m)of length N=2kn,where n is odd and k≥0.We first determine the structure of u-constacyclic codes of length n over the finite chain ring GR(2a,m)[u]/〈u2k+1...We investigate negacyclic codes over the Galois ring GR(2a,m)of length N=2kn,where n is odd and k≥0.We first determine the structure of u-constacyclic codes of length n over the finite chain ring GR(2a,m)[u]/〈u2k+1〉.Then using a ring isomorphism we obtain the structure of negacyclic codes over GR(2a,m)of length N=2kn(n odd)and explore the existence of self-dual negacyclic codes over GR(2a,m).A bound for the homogeneous distance of such negacvclic codes is also given.展开更多
基金supported by National Natural Science Foundation of China(Grant No.60973125)College Doctoral Funds of China(Grant No.20080359003)+1 种基金the Fundamental Research Funds for the Central Universities(Grant No.2011HGXJ1079)the open research fund of National Mobile Communications Research Laboratory,Southeast University
文摘We investigate negacyclic codes over the Galois ring GR(2a,m)of length N=2kn,where n is odd and k≥0.We first determine the structure of u-constacyclic codes of length n over the finite chain ring GR(2a,m)[u]/〈u2k+1〉.Then using a ring isomorphism we obtain the structure of negacyclic codes over GR(2a,m)of length N=2kn(n odd)and explore the existence of self-dual negacyclic codes over GR(2a,m).A bound for the homogeneous distance of such negacvclic codes is also given.
