摘要
主要研究了环R=F2+uF2+vF2上长为2k的(1+u)循环码,对该常循环码进行了分类,并给出了其计数公式.
The (1+u)-cyclic codes of length 2k over the ring R=F2+uF2 +vF2 were studied, and all such codes were classified. A formula for the number of these constacyclic codes was obtained.
基金
国家自然科学基金(61370089)资助
关键词
环上码
常循环码
计数公式
重根码
codes over rings
constacyclic codes
mass formula
repeated-root codes