Primitive idempotents of minimal cyclic codes of length 2p^n q
From MaRDI portal
Publication:4609233
zbMATH Open1429.94100MaRDI QIDQ4609233FDOQ4609233
Authors: Seema Rani, Pankaj Kumar, Inderjit Singh
Publication date: 29 March 2018
Recommendations
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Cyclic codes (94B15)
Cited In (8)
- Cyclotomic cosets and primitive idempotents in semisimple ring
- Minimal cyclic codes of length \(p^{n} q\).
- Primitive idempotents and generator polynomials of some minimal cyclic codes of length \({p^n}{q^m}\)
- Primitive idempotents of cyclic codes of length \(p\) and 2\(p\)
- Primitive idempotents in the ring \(F_4[x]/\langle x^{p^n}-1\rangle\) and cyclotomic \(Q\) codes
- The primitive idempotents of irreducible constacyclic codes and LCD cyclic codes
- Title not available (Why is that?)
- Primitive idempotents of irreducible cyclic codes of length \(p^nq^m\)
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)