Irreducible cyclic codes of length 2p^n.

MaRDI QIDQ3624973zbMATH OpenFDO

Authors Anuradha Sharma, Gurmeet K. Bakshi, Madhu Raka

Publication date 6 May 2009

zbMATH Keywords

cyclic codescyclotomic numbers

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 5844200
• Minimal cyclic codes of length 2p^n
• scientific article; zbMATH DE number 6468123
• Irreducible cyclic codes of length \(4p^n\) and \(8p^n\)
• Some cyclic codes of length \(2p^n\)

Cited in

(15)

• Primitive idempotents of irreducible cyclic codes of length \(p^nq^m\)
• Some cyclic codes of length \(2p^n\)
• Are<tex>$2$</tex>-Weight Projective Cyclic Codes Irreducible?
• On idempotents of a class of commutative rings
• All two-weight irreducible cyclic codes?
• The minimum Hamming distances of the irreducible cyclic codes of length \(l_1^{m_1}l_2^{m_2} \dots l_r^{m_r}\)
• Some minimal cyclic codes over finite fields
• Primitive idempotents of irreducible cyclic codes of length \(n\)
• The minimum Hamming distances of irreducible cyclic codes
• scientific article; zbMATH DE number 5844200 (Why is no real title available?)
• Idempotent generators of irreducible cyclic codes
• A class of minimal cyclic codes over finite fields
• Repeated-root constacyclic codes of length
• Irreducible cyclic codes of length \(4p^n\) and \(8p^n\)
• Primitive idempotents of cyclic codes of length \(p\) and 2\(p\)

This page was built for publication: Irreducible cyclic codes of length \(2p^n\).

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