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]/(xr−1)×R[x]/(xs−1). In this paper, we determine the generator polynomials of this family of codes as R[x]-submodules of R[x]/(xr−1)×R[x]/(xs−1). Further, we also give the minimal generating sets of this family of codes as R-submodules of R[x]/(xr−1)×R[x]/(xs−1). 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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.