Generating idempotents of some cyclic codes

MaRDI QIDQ2957580zbMATH OpenFDO

Authors Manju Pruthi

Publication date 26 January 2017

zbMATH Keywords

minimal idealprimitive idempotentsemisimple group algebra

Mathematics Subject Classification ID

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

Recommendations

• Idempotents generators for minimal cyclic codes of length p^nq
• Some cyclic codes of length \(2p^n\)
• scientific article; zbMATH DE number 1406438
• Generators idempotent in semi-simple ring \(FC_{16p^n}\), for the ideals corresponding to the minimal cyclic codes of length \(16p^n\) and the codes
• Study of idempotents in cyclic group rings over F2

Cited in

(4)

• Generating cyclically permutable codes (Corresp.)
• scientific article; zbMATH DE number 3543911 (Why is no real title available?)
• scientific article; zbMATH DE number 847152 (Why is no real title available?)
• Generators idempotent in semi-simple ring \(FC_{16p^n}\), for the ideals corresponding to the minimal cyclic codes of length \(16p^n\) and the codes

This page was built for publication: Generating idempotents of some cyclic codes

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