Minimal and maximal cyclic codes of length 2p

被引：0
|
作者：
Heboub, Lakhdar [1 ]
Mihoubi, Douadi [1 ]
机构：
[1] Msila Univ, Lab Pure & Appl Math, Dept Math, Msila, Algeria
来源：
JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY | 2024年 / 27卷 / 01期
关键词：
Linear and cyclic codes; Cyclotomic classes; Decomposition of ideals in semi-simple algebras;
D O I：
10.47974/JDMSC-1569
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
In this paper, we compute the maximal and minimal codes of length 2p over finite fields F-q with p and q are distinct odd primes and phi(p) = p - 1 is the multiplicative order of q modulo 2p. We show that, every cyclic code is a direct sum of minimal cyclic codes.
引用
收藏
页码：63 / 74
页数：12
相关论文
共 50 条
12345