Papers
Topics
Authors
Recent
Search
2000 character limit reached

Z2-double cyclic codes

Published 21 Oct 2014 in cs.IT, cs.DM, and math.IT | (1410.5604v1)

Abstract: A binary linear code $C$ is a $\mathbb{Z}_2$-double cyclic code if the set of coordinates can be partitioned into two subsets such that any cyclic shift of the coordinates of both subsets leaves invariant the code. These codes can be identified as submodules of the $\mathbb{Z}_2[x]$-module $\mathbb{Z}_2[x]/(xr-1)\times\mathbb{Z}_2[x]/(xs-1).$ We determine the structure of $\mathbb{Z}_2$-double cyclic codes giving the generator polynomials of these codes. The related polynomial representation of $\mathbb{Z}_2$-double cyclic codes and its duals, and the relations between the polynomial generators of these codes are studied.

Citations (33)

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.