A class of skew-constacyclic codes over \(\mathbb{Z}_{4} + u \mathbb{Z}_{4}\) (Q725963)
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: A class of skew-constacyclic codes over \(\mathbb{Z}_{4} + u \mathbb{Z}_{4}\) |
scientific article; zbMATH DE number 6912657
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A class of skew-constacyclic codes over \(\mathbb{Z}_{4} + u \mathbb{Z}_{4}\) |
scientific article; zbMATH DE number 6912657 |
Statements
A class of skew-constacyclic codes over \(\mathbb{Z}_{4} + u \mathbb{Z}_{4}\) (English)
0 references
2 August 2018
0 references
Summary: In this paper, we study a class of skew-constacyclic codes over \(R = \mathbb{Z}_{4} + u\mathbb{Z}_{4}\), which is a non-chain extension of \(\mathbb{Z}_{4}\). Some structural properties of \(R[x, \theta]\) are discussed, where {\(\theta\)} is an automorphism of \(R\). We determine a necessary condition and a sufficient condition for these codes to be free, when they are principally generated. A Gray map over \(R\) is defined and some good codes are obtained using it. For even \(n\), a relation between the generator polynomial of a code and that of its dual is obtained. Some examples are given to illustrate the results. Further, we have generalised these codes to double skew-constacyclic codes over \(R\). Some good codes with improved minimum Lee distance over \(\mathbb{Z}_{4}\) have been found via this class, and the same have been added to the database of \(\mathbb{Z}_{4}\) codes.
0 references
codes over \(\mathbb{Z}_{4} + u \mathbb{Z}_{4}\)
0 references
constacyclic codes
0 references
factorisations of polynomials
0 references
Gray map
0 references
skew polynomial rings
0 references
0.97565657
0 references
0.96936196
0 references
0.9614027
0 references
0 references
0.9409232
0 references
0.9351949
0 references
0.9332433
0 references
0 references