文章研究了环R=F2+uF2+vF2+uvF2上的(1+u+v)-常循环码,定义了一个Gray映射,证明了该环上的(1+u+v)一常循环码的Gray像是等距的准循环码,并利用该映射得到了二元好码,进一步确定了任意长度该常循环码的结构,同时也讨论了它的对偶码。
In this paper, the (1+u+v)-constacyclic codes over the ring R=F2 +uF2 +vF2 +uvF2 are discussed. Firstly, a Gray map of C is defined and it is proved that under this map the Gray image of C over R is a binary distance invariant quasi-eyclie code. And their dual codes are discussed. Then a set of generators of such eonstacyclic codes for an arbitrary length is determined. Finally, an optimal binary code is obtained from the Gray map.