The cyclic codes of length 5ps over Fpm + uFpm and their dual codes

被引：0

作者：

BOUDINE, B. R. A. H. I. M. ^{[1
]}

LAAOUINE, J. A. M. A. L. ^{[1
]}

CHARKANI, M. O. H. A. M. M. E. D. E. L. H. A. S. S. A. N. I. ^{[1
]}

机构：

[1] Sidi Mohamed Ben Abdellah Univ, Dept Math, Fac Sci, Fes 30003, Morocco

来源：

MATHEMATICAL COMMUNICATIONS | 2022年 / 27卷 / 01期

关键词：

Key words; cyclic code; cyclotomic polynomial; error-correcting codes; ROOT CONSTACYCLIC CODES; NEGACYCLIC CODES; GR(P(2); M);

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Let p be a prime integer and m an integer such that p equivalent to 2 (mod 5) or p equivalent to (mod 5), and let m be odd. We classify explicitly the cyclic codes of length 5p(s) over R = F-pm + uF(pm) with u(2) = 0 and compute completely their dual codes.

引用

页码：127 / 135

页数：9

共 20 条

[1] CALCULATING CYCLOTOMIC POLYNOMIALS [J].

Arnold, Andrew ;

Monagan, Michael .

MATHEMATICS OF COMPUTATION, 2011, 80 (276) :2359-2379

[2]

Atiyah M., 2018, INTRO COMMUTATIVE AL

[3]

Brown W.C., 1993, Matrices over Commutative Rings

[4] On the integral ideals ofR[X] whenRis a special principal ideal ring [J].

Charkani, M. E. ;

Boudine, B. .

SAO PAULO JOURNAL OF MATHEMATICAL SCIENCES, 2020, 14 (02) :698-702

[5] Repeated-root constacyclic codes of length lps and their duals [J].

Chen, Bocong ;

Dinh, Hai Q. ;

Liu, Hongwei .

DISCRETE APPLIED MATHEMATICS, 2014, 177 :60-70

[6] ON REPEATED-ROOT CONSTACYCLIC CODES OF LENGTH 4p(s) [J].

Dinh, Hai Q. .

ASIAN-EUROPEAN JOURNAL OF MATHEMATICS, 2013, 6 (02)

[7] Structure of repeated-root constacyclic codes of length 3ps and their duals [J].

Dinh, Hai Q. .

DISCRETE MATHEMATICS, 2013, 313 (09) :983-991

[8] Repeated-root constacyclic codes of length 2ps [J].

Dinh, Hai Q. .

FINITE FIELDS AND THEIR APPLICATIONS, 2012, 18 (01) :133-143

[9] Constacyclic codes of length ps over Fpm + uFpm [J].

Dinh, Hai Q. .

JOURNAL OF ALGEBRA, 2010, 324 (05) :940-950

[10] Cyclic and negacyclic codes over finite chain rings [J].

Dinh, HQ ;

López-Permouth, SR .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (08) :1728-1744

← 1 2 →