CYCLIC CODES OF LENGTH 2pn OVER FINITE CHAIN RINGS

被引:0
作者
Silva, Anderson [1 ]
Milies, C. Polcino [2 ]
机构
[1] Univ Fed Vicosa, Dept Matemat, BR-36570000 Vicosa, MG, Brazil
[2] Univ Sao Paulo, Inst Matemat & Estat, BR-05311970 Sao Paulo, SP, Brazil
基金
巴西圣保罗研究基金会;
关键词
Cyclic codes; chain rings; weights;
D O I
10.3934/amc.2020017
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We use group algebra methods to study cyclic codes over finite chain rings and under some restrictive hypotheses, described in section 2, for codes of length 2p(n), p a prime, we are able to compute the minimum weights of all possible cyclic codes of that length.
引用
收藏
页码:233 / 245
页数:13
相关论文
共 11 条