Primitive idempotents of a-constacyclic codes over F_q and their minimum Hamming distances

DOI10.1142/S1793830925500727MaRDI QIDQ7303546zbMATH OpenFDO

Authors Supakarn Rakphon, Wutichai Chongchitmate, Chakkrid Klin-eam

Publication date 24 July 2026

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S1793830925500727

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cyclic codes (94B15)

Cites work

• A class of minimal cyclic codes over finite fields
• Explicit factorization of \(x^{I_1^{m_1}I_2^{m_2}I_3^{m_3}}\) and \(a\)-constacyclic codes over a finite field
• Factorizations of Binomial Polynomials and Enumerations of LCD and Self-Dual Constacyclic Codes
• Fundamentals of Error-Correcting Codes
• Further factorization of \(x^n - 1\) over a finite field
• Further factorization of x^n-1 over a finite field. II
• scientific article; zbMATH DE number 5296403 (Why is no real title available?)
• Minimal codes of prime-power length.
• Minimal cyclic codes of length \(2p^n\)
• Self-reciprocal and self-conjugate-reciprocal irreducible factors of \(x^n - \lambda\) and their applications
• Some cyclic codes of length \(2p^n\)
• The minimum Hamming distances of irreducible cyclic codes
• The primitive idempotents and weight distributions of irreducible constacyclic codes
• The primitive idempotents of irreducible constacyclic codes and LCD cyclic codes

This page was built for publication: Primitive idempotents of \(a\)-constacyclic codes over \(\mathbb{F}_q\) and their minimum Hamming distances

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7303546)