A Study on Minimal Cyclic Codes of Length pnq

Exploring the properties of minimal cyclic codes of length pnq

Authors

  • Manjeet Singh

Keywords:

minimal cyclic codes, length pnq, circle R_(pn q), primitive root, early idempotents, gcd, polynomials, minimum cyclic length codes, GF(l)

Abstract

We aim at the circle R_(pn q) = GF (l)[x](x(pn q)-1), If p, q, are separate odd primes, both pn and q are a primitive root.. Explicit terminology for the entire (d+1)n+2 Early idempotents are acquired, d=gcd(ϕ(q)),p∤(q-1) Dimensions and distances created by polynomials are discussed as well as minimum cyclic length codes pnq over GF(l).

Downloads

Published

2014-01-01

How to Cite

[1]
“A Study on Minimal Cyclic Codes of Length pnq: Exploring the properties of minimal cyclic codes of length pnq”, JASRAE, vol. 7, no. 13, pp. 1–4, Jan. 2014, Accessed: Jun. 29, 2025. [Online]. Available: https://ignited.in/index.php/jasrae/article/view/5193

Issue

Vol. 7 No. 13 (2014): Journal of Advances and Scholarly Researches in Allied Education (JASRAE)

Section

Articles

How to Cite

[1]
“A Study on Minimal Cyclic Codes of Length pnq: Exploring the properties of minimal cyclic codes of length pnq”, JASRAE, vol. 7, no. 13, pp. 1–4, Jan. 2014, Accessed: Jun. 29, 2025. [Online]. Available: https://ignited.in/index.php/jasrae/article/view/5193