浏览全部资源
扫码关注微信
安徽新华学院公课部,安徽,合肥,230088
纸质出版:2015
移动端阅览
丁健, 李红菊, 左学武, 等. 环F2+uF2+u2F2上的常循环码[J]. 电子学报, 2015,43(1):145-150.
DING Jian, LI Hong-ju, ZUO Xue-wu, et al. Constacyclic Codes over the Ring F2+uF2+u2F2[J]. Acta Electronica Sinica, 2015, 43(1): 145-150.
丁健, 李红菊, 左学武, 等. 环F2+uF2+u2F2上的常循环码[J]. 电子学报, 2015,43(1):145-150. DOI: 10.3969/j.issn.0372-2112.2015.01.023.
DING Jian, LI Hong-ju, ZUO Xue-wu, et al. Constacyclic Codes over the Ring F2+uF2+u2F2[J]. Acta Electronica Sinica, 2015, 43(1): 145-150. DOI: 10.3969/j.issn.0372-2112.2015.01.023.
常循环码是一类重要的纠错码
本文基于(
x
n
-1)在
F
2
[
]
上的分解
探讨了环
R
=
+
uF
u
上任意长度的(1+
)常循环码的极小生成元集(
为
上的单位).通过分析该环上循环码和常循环码的置换等价性
得到了该环上码长为奇数及码长
N
2(mod 4)时(1+
)常循环码的生成多项式和极小生成元集.
Constacyclic codes are a kind of important error-correcting codes.In view of the factorization of (
-1) in
the minimal generating set of (1+
) constacyclic codes with an arbitrary length N over the ring
are investigated
where
is a unit of the ring
.Based on the analysis of the equivalence between cyclic codes and constacyclic codes over the ring
the generator polynomials and minimal
generating set of (1+
) constacyclic codes with odd length are obtained
so are the codes with length
2(mod 4).
0
浏览量
下载量
CSCD
关联资源
相关文章
相关作者
相关机构