On double cyclic codes over Z4

https://doi.org/10.1016/j.ffa.2016.02.003Get rights and content
Under an Elsevier user license
open archive

Abstract

Let R=Z4 be the integer ring mod 4. A double cyclic code of length (r,s) over 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[x]/(xr1)×R[x]/(xs1). In this paper, we determine the generator polynomials of this family of codes as R[x]-submodules of R[x]/(xr1)×R[x]/(xs1). Further, we also give the minimal generating sets of this family of codes as R-submodules of R[x]/(xr1)×R[x]/(xs1). Some optimal or suboptimal nonlinear binary codes are obtained from this family of codes. Finally, we determine the relationship of generators between the double cyclic code and its dual.

MSC

11T71
94B05
94B15

Keywords

Double cyclic codes
Generator polynomials
Minimal generating sets
Good nonlinear binary codes

Cited by (0)