{"paper":{"title":"On double cyclic codes over Z_4","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.RA"],"primary_cat":"cs.IT","authors_text":"Fang-Wei Fu, Jian Gao, Minjia Shi, Tingting Wu","submitted_at":"2015-01-07T03:33:13Z","abstract_excerpt":"Let $R=\\mathbb{Z}_4$ 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]/(x^r-1)\\times R[x]/(x^s-1)$. In this paper, we determine the generator polynomials of this family of codes as $R[x]$-submodules of $R[x]/(x^r-1)\\times R[x]/(x^s-1)$. Further, we also give the minimal generating sets of this family of codes as $R$-submodules of $R[x]/(x^r-1)\\times R[x]/(x^s-1)$. Some optimal or subo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01360","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}