Primitive idempotents of minimal cyclic codes of length 2p^n q

MaRDI QIDQ4609233zbMATH OpenFDO

Authors Seema Rani, Pankaj Kumar, Inderjit Singh

Publication date 29 March 2018

zbMATH Keywords

primitive rootsprimitive idempotentsminimal cyclic codes and cyclotomic cosets

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Cyclic codes (94B15)

Recommendations

• scientific article; zbMATH DE number 6468123
• Minimal cyclic codes of length \(p^{n} q\).
• Primitive idempotents of irreducible cyclic codes of length \(p^nq^m\)
• Minimal cyclic codes of length 2p^n
• Minimal cyclic codes of length p^nq

Cited in

(8)

• Primitive idempotents of irreducible cyclic codes of length \(p^nq^m\)
• Primitive idempotents and generator polynomials of some minimal cyclic codes of length \({p^n}{q^m}\)
• Minimal cyclic codes of length \(p^{n} q\).
• Cyclotomic cosets and primitive idempotents in semisimple ring
• The primitive idempotents of irreducible constacyclic codes and LCD cyclic codes
• scientific article; zbMATH DE number 5968526 (Why is no real title available?)
• Primitive idempotents in the ring \(F_4[x]/\langle x^{p^n}-1\rangle\) and cyclotomic \(Q\) codes
• Primitive idempotents of cyclic codes of length \(p\) and 2\(p\)

This page was built for publication: Primitive idempotents of minimal cyclic codes of length \(2p^n q\)

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