Minimal cyclic codes of length pnq

被引：44

作者：

Bakshi, GK ^{[1
]}

Raka, M ^{[1
]}

机构：

[1] Panjab Univ, Ctr Adv Study Math, Chandigarh 160014, India

来源：

FINITE FIELDS AND THEIR APPLICATIONS | 2003年 / 9卷 / 04期

关键词：

primitive idempotents; primitive roots; minimal cyclic codes and cyclotomic cosets;

D O I：

10.1016/S1071-5797(03)00023-6

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Explicit expressions for all the 3n + 2 primitive idempotents in the ring R-pnq = GF(l)[x]/(x(pnq) - 1), where p, q, l are distinct odd primes, l is a primitive root modulo p(n) and q both, gcd(phi(p(n))/2, phi(q)/2) = 1, are obtained. The dimension, generating polynomials and the minimum distance of the minimal cyclic codes of length p(n)q over GF(l) are also discussed. (C) 2003 Elsevier Science (USA). All rights reserved.

引用

页码：432 / 448

页数：17

共 6 条

[1] Minimal cyclic codes of length 2pn [J].

Arora, SK ;

Pruthi, M .

FINITE FIELDS AND THEIR APPLICATIONS, 1999, 5 (02) :177-187

[2]

BAKSHI GK, UNPUB DES CODES CRYT

[3]

BAKSHI GK, IN PRESS RANCHI U MA, V32

[4]

MACWILLIAMS FJ, 1977, THEORY ERROR CORRECI

[5]

Pruthi M., 1997, Finite Fields and their Applications, V3, P99, DOI 10.1006/ffta.1996.0156

[6] Cyclic codes of length 2m [J].

Pruthi, M .

PROCEEDINGS OF THE INDIAN ACADEMY OF SCIENCES-MATHEMATICAL SCIENCES, 2001, 111 (04) :371-379

← 1 →