Minimal and maximal cyclic codes of length 2p

Loading...
Thumbnail Image

Date

2022

Journal Title

Journal ISSN

Volume Title

Publisher

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

Description

Keywords

Linear and cyclic codes, Cyclotomic classes, Decomposition of ideals in semi-simple algebras.

Citation