Some cyclic codes of length 2p n

• DOI: 10.1007/s10623-010-9438-0
• Publication Date: 2010-10-13T20:58:25Z
• Authors: Sudhir Batra; S. K. Arora
• Keywords: 0202 electrical engineering, electronic engineering, information engineering; 0102 computer and information sciences; 02 engineering and technology; 01 natural sciences

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.