Primitive idempotents of irreducible cyclic codes of length \(n\)

DOI10.1155/2018/6962508zbMath1427.94101OpenAlexW2806662552MaRDI QIDQ1721319

Qin Yue, Yuqian Lin, Yansheng Wu

Publication date: 8 February 2019

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2018/6962508

Mathematics Subject Classification ID

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

Related Items

New \(\ast\)-clean finite group rings under the conjugate involution

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some minimal cyclic codes over finite fields
• Explicit factorization of \(x^n-1\in \mathbb {F}_q[x\)]
• The minimum Hamming distances of irreducible cyclic codes
• 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\).
• Irreducible cyclic codes of length \(4p^n\) and \(8p^n\)
• A construction of linear codes and their complete weight enumerators
• Explicit factorization of \(X^{2^m}p^n-1\) over a finite field
• The minimum Hamming distances of the irreducible cyclic codes of length
• A class of minimal cyclic codes over finite fields
• Complete weight enumerators of a class of linear codes
• A class of minimal cyclic codes over finite fields