(1+λu)-Constacyclic codes over Fp[u]/⟨um⟩

被引:34
作者
Kai, Xiaoshan [1 ,2 ]
Zhu, Shixin [1 ,2 ]
Li, Ping [1 ,2 ]
机构
[1] Hefei Univ Technol, Sch Math, Hefei 230009, Anhui, Peoples R China
[2] Southeast Univ, Natl Mobile Commun Res Lab, Nanjing 210096, Peoples R China
来源
JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS | 2010年 / 347卷 / 05期
基金
中国国家自然科学基金;
关键词
Linear codes; Constacyclic codes; Gray map; Generator polynomial; SELF-DUAL CODES; FINITE CHAIN RING; CYCLIC CODES; NEGACYCLIC CODES; LINEAR CODES; CONSTACYCLIC CODES; EVEN LENGTH; IMPROVEMENTS; BOUNDS; Z(4);
D O I
10.1016/j.jfranklin.2010.02.003
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Motivated by the work in [1] of Abualrub and Siap (2009), we investigate (1 + lambda u)-constacyclic codes over F-p[u]/< u(m)> of an arbitrary length, where lambda is an on zero element of F-p. We find the generator polynomials of (1 + lambda u)-constacyclic codes over F-p[u]/< u(m)>, and determine the number of (1 + lambda u)-constacyclic codes over F-p[u]/< u(m)> for a given length, as well as the number of code words in each such code. Some optimal linear codes over F-3 and F-5 are constructed from (1 + lambda u)-constacyclic codes over F-p + uF(p) under a Gray map. (C) 2010 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.
引用
收藏
页码:751 / 762
页数:12
相关论文
共 25 条