Double cyclic codes over \(\mathbb{F}_q + u\mathbb{F}_q + u^2\mathbb{F}_q\) (Q274537)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6572840
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Double cyclic codes over \(\mathbb{F}_q + u\mathbb{F}_q + u^2\mathbb{F}_q\) |
scientific article; zbMATH DE number 6572840 |
Statements
Double cyclic codes over \(\mathbb{F}_q + u\mathbb{F}_q + u^2\mathbb{F}_q\) (English)
0 references
22 April 2016
0 references
Summary: A double cyclic code of length \((r, s)\) over a chain ring \(R\) is a set that can be partitioned into two parts that any cyclic shift of the coordinates of both parts leaves invariant the code. These codes can be viewed as \(R[x]\)-submodules of \(R^r \times R^s\). In this paper, the generator polynomials of this family of codes as \(R[x]\)-submodules of \(R^r \times R^s\) are determined. Further, the minimal generating sets of this family of codes as \(R\)-submodules of \(R^r \times R^s\) are obtained. Finally, we show the relationship of generators between the double cyclic code and its dual.
0 references
double cyclic codes
0 references
generator polynomials
0 references
minimal generating sets
0 references
dual codes
0 references
chain rings
0 references
0.95122695
0 references
0.9354175
0 references
0.93519545
0 references
0.93326104
0 references
0 references
0.92832696
0 references
0 references
0 references