Minimal cyclic codes of length \(p^nq\)

DOI10.1016/j.ffa.2012.07.003zbMath1274.94148OpenAlexW156592536MaRDI QIDQ714464

Poonam Trama Sehgal, Amita Sahni

Publication date: 11 October 2012

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ffa.2012.07.003

zbMATH Keywords

generating polynomialsprimitive rootsprimitive idempotentscyclotomic cosetsminimal cyclic codes

Mathematics Subject Classification ID

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

Related Items (7)

Some minimal cyclic codes over finite fields ⋮ A class of minimal cyclic codes over finite fields ⋮ A note on the weight distribution of some cyclic codes ⋮ A class of minimal cyclic codes over finite fields ⋮ On equivalency of zero-divisor codes via classifying their idempotent generator ⋮ Minimum distance and idempotent generators of minimal cyclic codes of length ${p_1}^{\alpha_1}{p_2}^{\alpha_2}{p_3}^{\alpha_3}$ ⋮ Unnamed Item

Cites Work

• Minimal codes of prime-power length.
• Minimal cyclic codes of length \(2p^n\)
• Cyclic codes of length \(2^m\)
• Minimal cyclic codes of length \(p^{n} q\).
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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