A MACWILLIAMS TYPE IDENTITY ON LEE WEIGHT FOR LINEAR CODES OVER F2 + uF2
- ISSN号:1009-6124
- 期刊名称:Journal of Systems Science and Complexity
- 时间:0
- 页码:186-194
- 分类:S513[农业科学—作物学] TN919.31[电子电信—通信与信息系统;电子电信—信息与通信工程]
- 作者机构:[1]School of Mathematics, Hefei University of Technology, Hefei 230009, China, [2]National Mobile CommunicationsResearch Laboratory, Southeast University, Nanjing 210096, China., [3]School of Mathematics, Hefei University of Technology, Hefei 230009, China.
- 相关基金:This research was supported by the National Natural Science Foundation of China under Grant No. 60973125, the Natural Science Foundation of Anhui Province under Grant No. 1208085MA14, and the Fundamental Research Funds for the Central Universities under Grants Nos. 2012HGXJ0040 and 2011HGBZ1298.
- 相关项目:多维序列的的快速生成算法及其在序列密码中的应用研究
关键词:
准循环码, F2, 家庭, GRAY映射, 任意长度, 二进制码, 发电机, Constacyclic code, generator polynomial, Gray distance, Gray map.
中文摘要:
这份报纸学习(1 + u )-constacyclic 在戒指 F 2 + uF 上编码 2 + vF 2 + uvF 2。这被证明图象一(1+u ) 在 2 在一个格雷下面印射的 F 2+uF 2+vF 2+uvF 上的长度 n 的 -constacyclic 代码是距离索引 2 的不变的二进制伪周期的代码和长度 4n。为任意的长度的如此的 constacyclic 代码的一套生成器被决定。一些最佳的二进制代码直接被获得从(1 + u )-constacyclic 在 F 2 + uF 上编码 2 + vF 2 + uvF 2。
英文摘要:
This paper studies (1 + u)-constacyelic codes over the ring F2 + uF2 + vF,2 + uvF2. It is proved that the image of a (1 + u)-constacyclic code of length n over F2 + uF2 + vF2 +uvF2 under a Gray map is a distance invariant binary quasi-cyclic code of index 2 and length 4n. A set of generators of such constacyclic codes for an arbitrary length is determined, Some optimal binary codes are obtained directly from (1 + u)-constacyclic codes over F2 + uF2 + vF2 + uvF2.