Explicit factorization of xl1m1l2m2l3m3−a and a-constacyclic codes over a finite field

DOI10.1080/00927872.2022.2072854OpenAlexW4280602544MaRDI QIDQ5097411

Wutichai Chongchitmate, Supakarn Rakphon, Chakkrid Klin-eam, Jirayu Phuto

Publication date: 23 August 2022

Published in: Communications in Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00927872.2022.2072854

zbMATH Keywords

constacyclic codesgenerator polynomialscyclotomic cosetirreducible factor polynomials

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• The primitive idempotents and weight distributions of irreducible constacyclic codes
• Further factorization of \(x^n - 1\) over a finite field
• The primitive idempotents of irreducible constacyclic codes and LCD cyclic codes
• Explicit factorization of \(X^{2^m}p^n-1\) over a finite field
• Fundamentals of Error-Correcting Codes
• A class of minimal cyclic codes over finite fields

This page was built for publication: Explicit factorization of xl1m1l2m2l3m3−a and a-constacyclic codes over a finite field