Abstract
Explicit expressions for 4n + 2 primitive idempotents in the semi-simple group ring $$R_{2p^{n}}\equiv \frac{GF(q)[x]}{}$$ are obtained, where p and q are distinct odd primes; n � 1 is an integer and q has order $${\frac{\phi(2p^{n})}{2}}$$ modulo 2p n . The generator polynomials, the dimension, the minimum distance of the minimal cyclic codes of length 2p n generated by these 4n + 2 primitive idempotents are discussed. For n = 1, the properties of some (2p, p) cyclic codes, containing the above minimal cyclic codes are analyzed in particular. The minimum weight of some subset of each of these (2p, p) codes are observed to satisfy a square root bound.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
