On cyclic codes of length \(p^n\ell^m\) over a finite field (Q516621)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On cyclic codes of length \(p^n\ell^m\) over a finite field |
scientific article; zbMATH DE number 6694900
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On cyclic codes of length \(p^n\ell^m\) over a finite field |
scientific article; zbMATH DE number 6694900 |
Statements
On cyclic codes of length \(p^n\ell^m\) over a finite field (English)
0 references
14 March 2017
0 references
Summary: Let \(p,\ell\) be distinct odd primes, \(q\) be a prime power with \(\mathrm{gcd}(q,p)=\mathrm{gcd}(q,\ell)=1\), and \(m,n\) be positive integers. In this paper, we determine all self-orthogonal and complementary-dual cyclic codes of length \(p^n\ell^m\) over the finite field \(\mathbb{F}_q\) with \(q\) elements. We also illustrate our results with some examples.
0 references
cyclotomic cosets
0 references
dual codes
0 references
negacyclic codes
0 references
simple-root cyclic codes
0 references
finite field
0 references
self-orthogonal cyclic codes
0 references
complementary-dual cyclic codes
0 references
