期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Ranks of Repeated-Root Constacyclic Code
1
作者 LI Hongju DING Jian TANG Yongsheng 《Wuhan University Journal of Natural Sciences》 CAS CSCD 2016年第5期453-460,共8页
By the discussion of division in F2m[u]/〈u4〉,the minimal spanning set and the rank of a(1+u+u2)-constacyclic code with an arbitrary length N=2en over F2m[u]/〈u4〉 are determined based on the factorization of(x... By the discussion of division in F2m[u]/〈u4〉,the minimal spanning set and the rank of a(1+u+u2)-constacyclic code with an arbitrary length N=2en over F2m[u]/〈u4〉 are determined based on the factorization of(xn-1) over F2m. 展开更多
关键词 constacyclic codes RANK the minimal spanning set
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部