The minimum Hamming distances of irreducible cyclic codes

DOI10.1016/j.ffa.2014.05.003zbMath1332.94105OpenAlexW2081953020MaRDI QIDQ740312

Fengwei Li, Chengju Li, Qin Yue

Publication date: 2 September 2014

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

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

zbMATH Keywords

finite fieldirreducible cyclic codeprimitive idempotent

Mathematics Subject Classification ID

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

Related Items (17)

A class of cyclic codes whose duals have five zeros ⋮ The minimum Hamming distances of the irreducible cyclic codes of length ⋮ The primitive idempotents of irreducible constacyclic codes and LCD cyclic codes ⋮ Weight enumerators of some irreducible cyclic codes of odd length ⋮ A new class of distance-optimal binary cyclic codes and their duals ⋮ A class of optimal ternary cyclic codes and their duals ⋮ Weight enumerators of all cubic-primitive irreducible cyclic codes of odd prime power length ⋮ Weight enumerators of reducible cyclic codes and their dual codes ⋮ A class of minimal cyclic codes over finite fields ⋮ Primitive idempotents of irreducible cyclic codes of length \(n\) ⋮ A note on the weight distribution of some cyclic codes ⋮ The primitive idempotents and weight distributions of irreducible constacyclic codes ⋮ Primitive idempotents of irreducible cyclic codes and self-dual cyclic codes over Galois rings ⋮ A reduction theorem for the existence of \(\ast\)-clean finite group rings ⋮ New \(\ast\)-clean finite group rings under the conjugate involution ⋮ On an open problem about a class of optimal ternary cyclic codes ⋮ Irreducible cyclic codes of length \(4p^n\) and \(8p^n\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some cyclic codes of length \(2p^n\)
• Constacyclic codes over finite fields
• 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\).
• Explicit factorization of \(X^{2^m}p^n-1\) over a finite field
• The primitive idempotents of a cyclic group algebra. II.

This page was built for publication: The minimum Hamming distances of irreducible cyclic codes