中国科学技术大学学报 ›› 2015, Vol. 45 ›› Issue (1): 40-47.DOI: 10.3969/j.issn.0253-2778.2015.01.007

• 论著 • 上一篇    

环F2+uF2+u2F2上的(1+u)常循环码

丁健,李红菊   

  1. 安徽新华学院公课部,安徽合肥 230088
  • 收稿日期:2014-03-12 修回日期:2014-05-16 接受日期:2014-05-16 出版日期:2014-05-16 发布日期:2014-05-16
  • 通讯作者: 丁健
  • 作者简介:丁健(通讯作者),男,1982年生,硕士/讲师. 研究方向:密码学. E-mail: dingjian_happy@163.com
  • 基金资助:
    安徽省高等学校自然科学项目(KJ2013B107),新华学院自然科学项目(2014ZR009)资助.

(1+u)-constacyclic codes over the ring F2+uF2+u2F2

DING Jian, LI Hongju   

  1. Department of Common Course, Anhui Xinhua University, Hefei 230088, China
  • Received:2014-03-12 Revised:2014-05-16 Accepted:2014-05-16 Online:2014-05-16 Published:2014-05-16

摘要: 基于(xn-1)在F2[x]上的分解,研究了环R=F2+uF2+u2F2上任意长度的(1+u)常循环码的秩和极小生成元集,定义了环R到F42的一个新的Gray映射,确定了环R上任意长度的(1+u)常循环码的Gray象的结构及Gray象的生成多项式,得到了一些最优的二元线性循环码.

关键词: 常循环码, 秩, 极小生成元集, Gray映射

Abstract: In view of the factorization of (xn-1) in F2[x], the minimal generating set and rank of (1+u)-constacyclic codes with an arbitrary length over the ring R=F2+uF2+u2F2 were studied. A new Gray map from R to F42 was defined, the structures and generator polynomials of the Gray image of a linear (1+u)-constacyclic code with an arbitrary length were determined, and some optimal binary linear cyclic codes were obtained.

Key words: constacyclic codes, rank, the minimal generating set, Gray map

中图分类号: