Minimal and maximal cyclic codes of length 2p
-
Published:2024
Issue:1
Volume:27
Page:63-74
-
ISSN:0972-0529
-
Container-title:Journal of Discrete Mathematical Sciences & Cryptography
-
language:
-
Short-container-title:JDMSC
Author:
Heboub Lakhdar,Mihoubi Douadi
Abstract
In this paper, we compute the maximal and minimal codes of length 2p over finite fields Fq with p and q are distinct odd primes and f(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.
Publisher
Taru Publications