Cyclic codes over \({\mathbb{F}}_2 + u{\mathbb{F}}_2 + v{\mathbb{F}}_2 + uv{\mathbb{F}}_2\) (Q2430408)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Cyclic codes over \({\mathbb{F}}_2 + u{\mathbb{F}}_2 + v{\mathbb{F}}_2 + uv{\mathbb{F}}_2\) |
scientific article |
Statements
Cyclic codes over \({\mathbb{F}}_2 + u{\mathbb{F}}_2 + v{\mathbb{F}}_2 + uv{\mathbb{F}}_2\) (English)
0 references
6 April 2011
0 references
Linear codes over finite chain rings have been studied for several authors [see e.g. \textit{T. Abualrud, I, Siap}, Des. Codes Crypt. 42, 273--287 (2007; Zbl 1143.94020)]. The subject matter of this paper has to do with the study of cyclic codes over the ring \(R:={\mathbb F}_2 +u{\mathbb F}_2+v{\mathbb F}_2+uv {\mathbb F}_2\), where \({\mathbb F}_2\) is the field with two elements and the symbols \(u\) and \(v\) are such that \(u^2=v^2=0\) and \(uv=vu\). A particularity here is that the ring \(R\) is not finite chain ring; however, by using ideas from group rings and ideas of the aforementioned reference the authors manage to characterize both the ring \(R/(x^n-1)\) and a cyclic code over \(R\) of odd length. They also obtain good binary codes as the images of codes over \(R\) by means of two Gray maps. Finally, they also characterize the binary images of arbitrary cyclic codes over \(R\). This paper complements a previous paper of the authors [Des. Codes Crypt. 54, No. 1, 61--81 (2010; Zbl 1187.94045)].
0 references
Lee weights
0 references
homogeneous weight
0 references
Gray maps
0 references
cyclic codes
0 references
quasi-cyclic codes
0 references
0 references