Abstract

We consider the ring  where 𝑝,𝑞,𝑙 are distinct odd primes, l is a primitive root, both modulo  such that  .Explicit expressions for all the 16(𝑚×𝑛×𝑑+𝑚+𝑛+1) Cyclotomic Coset are obtained, 𝑝 does not divide q−1 and 𝑙 is of the form 16k+1.

Keywords

Cyclotomic Coset, Cyclic Codes, Minimal Cyclic Codes, Primitive Idempotent.

References

[1] Anuradha Sharma et al., “Cyclotomic Numbers and Primitive Idempotents in the Ring GF(q) [x]/( ,” Finite Fields and Their Applications, vol. 10, no. 4, pp. 653-673, 2004.
[CrossRef] [Google Scholar] [Publisher Link]

[2] Gurmeet K. Bakshi, and Madhu Raka, “Minimal Cyclic Codes of Length pⁿq,” Finite Fields and Their Applications, vol. 9, no. 4, pp. 432-448, 2003.
[CrossRef] [Google Scholar] [Publisher Link]

[3] Amita Sahni, and Poonam Trama Sehgal, “Minimal Cyclic Codes of Length pⁿq,” Finite Fields and Their Applications, vol. 18, no. 5, pp. 1017-1036, 2012.
[CrossRef] [Google Scholar] [Publisher Link]

[4] Gurmeet Kaur Bakshi, Madhu Raka, and Anuradha Sharma, “Idempotent Generators of Irreducible Cyclic Codes,” Number Theory & Discrete Geometry, vol. 6, pp. 13-18, 2008.
[Google Scholar]

[5] Ranjeet Singh, and Manju Pruthi, “Primitive Idempotents of Irreducible Quadratic Residue Cyclic Codes of Length p^nq^m,” International Journal of Algebra, vol. 5, no. 5-8, pp. 285-294, 2011.
[Google Scholar] [Publisher Link]

[6] Florence Jessie MacWilliams, and Neil James Alexander Sloane, The Theory of Error-Correcting Codes, vol. 16, Elsevier, 1977.
[Google Scholar]

[7] Vera Pless, Introduction to the Theory of Error-Correcting Codes, John Wiley & Sons, 1988.
[Google Scholar]

[8] George Nemhauser, and Laurence Wolsey, Wiley-Interscience Series in Discrete Mathematics and Optimization, Wiley, 1998.
[CrossRef] [Google Scholar] [Publisher Link]

[9] Jagbir Singh, and Sonika Ahlawat, “Some Cyclic Codes of Length 4pn and Their Minimum Distance Bounds,” International Journal of Applied Engineering Research, vol. 13, no. 23, pp. 16708-16718, 2018.
[Publisher Link]

[10]  Jagbir Singh, and S.K. Arora, “Minimal Cyclic Codes of Length 8pⁿ over GF(q), where q is Prime Power of the Form 8k +5,” Journal of Applied Mathematics and Computing, vol. 48, no. 1-2, pp. 55-69, 2014.
[CrossRef] [Google Scholar] [Publisher Link]

[11] Jagbir Singh, S.K. Arora, and Sheetal Chawla, “Some Cyclic Codes of Length 8pⁿ,” International Journal of Pure and Applied Mathematics, vol. 116, no. 1, pp. 217-241, 2017.
[CrossRef] [Google Scholar]

[12] Ranjeet Singh, “Some Cyclotomic Cosets in the Ring R_(8p^n q^m )=GF(l)[x] (x^(8p^n q^m )-1),” International Journal of Advanced Research, vol. 14, no. 4, pp. 93-939, 2026.
[CrossRef] [Publisher Link]