Primitive idempotents of irreducible cyclic codes of length \(n\)
type: Item
instance of: scholarly article
title: Primitive idempotents of irreducible cyclic codes of length \(n\)
zbMATH Open document ID: 1427.94101
DOI: 10.1155/2018/6962508
author: Yuqian Lin
author: Qin Yue
author: Yansheng Wu
published in: Mathematical Problems in Engineering
publication date: 2019-02-08T00:00:00Z
review text: Summary: Let \(\mathbb{F}_q\) be a finite field with \(q\) elements and \(n\) a positive integer. In this paper, we use matrix method to give all primitive idempotents of irreducible cyclic codes of length \(n\), whose prime divisors divide \(q - 1\).
Mathematics Subject Classification ID: 94B15
Mathematics Subject Classification ID: 11T71
Mathematics Subject Classification ID: 94B05
zbMATH DE Number: 7019375
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2018/6962508
OpenAlex ID: W2806662552
cites work: Minimal cyclic codes of length \(2p^n\)
cites work: Minimal codes of prime-power length.
cites work: Cyclic codes of length \(2^m\)
cites work: Q3070243
cites work: Minimal cyclic codes of length \(p^{n} q\).
cites work: Q3095921
cites work: Some minimal cyclic codes over finite fields
cites work: A class of minimal cyclic codes over finite fields
cites work: The minimum Hamming distances of irreducible cyclic codes
cites work: Irreducible cyclic codes of length \(4p^n\) and \(8p^n\)
cites work: The minimum Hamming distances of the irreducible cyclic codes of length
cites work: Explicit factorization of \(X^{2^m}p^n-1\) over a finite field
cites work: Explicit factorization of \(x^n-1\in \mathbb {F}_q[x]\)
cites work: Complete weight enumerators of a class of linear codes
cites work: A construction of linear codes and their complete weight enumerators
cites work: Q4379555
description: scientific article; zbMATH DE number 7019375