Abstract
Explicit expressions for 4n + 2 primitive idempotents in the semi-simple group ring \(R_{2p^{n}}\equiv \frac{GF(q)[x]}{<x^{2p^{n}}-1>}\) 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.
Similar content being viewed by others
References
Apostol T.M.: Introduction to Analytic Number Theory. Narosa Publishing House, New Delhi (1989)
Arora S.K., Pruthi M.: Minimal cyclic codes of length 2p n. Finite Fields Appl. 5, 177–187 (1999)
Arora S.K., Batra S., Cohen S.D., Pruthi M.: The primitive idempotents of a cyclic group algebra. Southeast Asian Bull. Math. 26, 197–208 (2002)
Arora S.K., Batra S., Cohen S.D.: The primitive idempotents of a cyclic group algebra II. Southeast Asian Bull. Math. 29, 549–557 (2005)
Bakshi G.K., Dumir V.C., Raka M.: Minimal cyclic codes of length 2m. Ranchi Univ. Math. J. 33, 1–18 (2002)
Bakshi G.K., Raka M.: Minimal Cyclic Codes of length p n q. Finite Fields Appl. 9, 432–438 (2003)
Batra S., Arora S.K.: Minimal quadratic residue cyclic codes of length p n(p odd). J. Appl. Math. Comput. (Old: KJCAM) 8(3), 531–547 (2001)
Batra S., Arora S.K.: Minimal quadratic residue cyclic codes of length 2n. J. Appl. Math. Comput. (Old: KJCAM) 18(1–2), 25–43 (2005)
Burton D.M.: Elementary Number Theory. Tata McGraw-Hill Publishers, New Delhi (2007)
Coppersmith D., Seroussi G.: On the minimum distance of some quadratic residue codes. IEEE Trans. Inform. Theory 30(2), 407–411 (1984)
Ferraz R., Polcino Milies C.: Idempotents in group algebras and minimal Abelian codes. Finite Fields Appl. 13(2), 382–393 (2007)
MacWilliams F.J., Sloane N.J.A.: The theory of error correcting codes. North Holland, Amsterdam (1977)
Pless V.: Introduction to the Theory of Error Correcting Codes. Wiley, New York (1998)
Pruthi M.: Cyclic codes of length 2m. Proc. Indian Acad. Sci. Math. Sci. 111, 371–379 (2001)
Pruthi M., Arora S.K.: Minimal codes of prime-power length. Finite Fields Appl. 3, 99–113 (1997)
Remijn J.C.C.M., Devroedt C.: The minimum distance of the [38,19] ternary extended QR-code is 11. IEEE Trans. Inform. Theory 30(2), 405–407 (1994)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by J. Wolfmann.
Rights and permissions
About this article
Cite this article
Batra, S., Arora, S.K. Some cyclic codes of length 2p n . Des. Codes Cryptogr. 61, 41–69 (2011). https://doi.org/10.1007/s10623-010-9438-0
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-010-9438-0
Keywords
- Group rings
- Cyclic codes
- Dual codes
- Primitive idempotents
- Generator polynomials
- Square root bound
- QR codes