Minimal and maximal cyclic codes of length 2p

Abstract

In this paper, we compute the maximal and minimal codes of length 2p over finite fields q  with p and q are distinct odd primes and f( )= 1 p p − is the multiplicative order of q modulo 2p. We show that, every cyclic code is a direct sum of minimal cyclic codes