Generators idempotent in semi-simple ring FC₁₆p^n, for the ideals corresponding to the minimal cyclic codes of length 16p^n and the codes

zbMATH Open1463.11159MaRDI QIDQ5144192FDOQ5144192

Authors: Vishvajit Singh, Manju Pruthi, J. Singh 

Publication date: 15 January 2021

Full work available at URL: http://rsmams.org/journals/articleinfo.php?articleid=390&tag=seajmams

Recommendations

• Some cyclic codes of length \(2p^n\)
• scientific article; zbMATH DE number 6468123
• Minimum distance and idempotent generators of minimal cyclic codes of length \({p_1}^{\alpha_1}{p_2}^{\alpha_2}{p_3}^{\alpha_3}\)
• Primitive idempotents and generator polynomials of some minimal cyclic codes of length \({p^n}{q^m}\)
• Generating idempotents of some cyclic codes

zbMATH Keywords

minimum distancecyclotomic cosetsgenerating polynomialsprimitive idempotents

Mathematics Subject Classification ID

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

Cites Work

• Minimal codes of prime-power length.
• Minimal cyclic codes of length \(2p^n\)
• Minimal cyclic codes of length \(p^{n} q\).
• Minimal quadratic residue cyclic codes of length \(p^n\) (\(p\) odd prime)
• Some cyclic codes of length \(2p^n\)
• Minimal cyclic codes of length \(p^nq\)
• The primitive idempotents of a cyclic group algebra.
• Irreducible cyclic codes of length \(4p^n\) and \(8p^n\)
• Minimal cyclic codes of length \(8p^n\) over \(\mathrm{GF}(q)\), where \(q\) is prime power of the form \(8k+5\)

This page was built for publication: 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

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