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.
Full Text
Sign-in/Register to access full text options
Published version (Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Journal of Discrete Mathematical Sciences & Cryptography
Paper Title
Journal
Date