Irreducible cyclic codes of length 2p^n.
From MaRDI portal
Publication:3624973
zbMATH Open1174.12004MaRDI QIDQ3624973FDOQ3624973
Authors: Anuradha Sharma, Gurmeet K. Bakshi, Madhu Raka
Publication date: 6 May 2009
Recommendations
Cited In (14)
- Some minimal cyclic codes over finite fields
- Are<tex>$2$</tex>-Weight Projective Cyclic Codes Irreducible?
- Idempotent generators of irreducible cyclic codes
- Irreducible cyclic codes of length \(4p^n\) and \(8p^n\)
- Some cyclic codes of length \(2p^n\)
- A class of minimal cyclic codes over finite fields
- Repeated-root constacyclic codes of length
- All two-weight irreducible cyclic codes?
- The minimum Hamming distances of irreducible cyclic codes
- Title not available (Why is that?)
- Primitive idempotents of irreducible cyclic codes of length \(n\)
- Primitive idempotents of cyclic codes of length \(p\) and 2\(p\)
- On idempotents of a class of commutative rings
- Primitive idempotents of irreducible cyclic codes of length \(p^nq^m\)
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)