Idempotents generators for minimal cyclic codes of length p^nq

DOI10.1007/978-3-319-17296-5_37zbMATH Open1344.94089OpenAlexW2343232297MaRDI QIDQ3460484FDOQ3460484

Authors: Gustavo Terra Bastos, Marinês Guerreiro 

Publication date: 7 January 2016

Published in: Coding Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-17296-5_37

Recommendations

• Minimal cyclic codes of length \(p^nq\)
• Minimal codes of prime-power length.
• scientific article; zbMATH DE number 6468123
• Minimal cyclic codes of length \(p^{n} q\).
• Primitive idempotents and generator polynomials of some minimal cyclic codes of length \({p^n}{q^m}\)

zbMATH Keywords

primitive idempotentsminimal cyclic codes

Mathematics Subject Classification ID

Group rings of finite groups and their modules (group-theoretic aspects) (20C05) Cyclic codes (94B15)

Cites Work

• Simple components and central units in group algebras.
• Idempotents in group algebras and minimal abelian codes
• An introduction to group rings
• \(\lambda\)-mapping and primitive idempotents in semisimple ring \(\mathfrak R_m\)
• Minimal codes of prime-power length.
• Minimal cyclic codes of length \(p^{n} q\).

Cited In (4)

• Generating idempotents of some cyclic codes
• Group algebras and coding theory
• Primitive idempotents and generator polynomials of some minimal cyclic codes of length \({p^n}{q^m}\)
• Title not available (Why is that?)

This page was built for publication: Idempotents generators for minimal cyclic codes of length \(p^nq\)

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