{"paper":{"title":"New quantum codes from dual-containing cyclic codes over finite rings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jian Ding, Shixin Zhu, Xiaoshan Kai, Yongsheng Tang","submitted_at":"2016-08-24T00:44:03Z","abstract_excerpt":"Let $R=\\mathbb{F}_{2^{m}}+u\\mathbb{F}_{2^{m}}+\\cdots+u^{k}\\mathbb{F}_{2^{m}}$ , where $\\mathbb{F}_{2^{m}}$ is a finite field with $2^{m}$ elements, $m$ is a positive integer, $u$ is an indeterminate with $u^{k+1}=0.$ In this paper, we propose the constructions of two new families of quantum codes obtained from dual-containing cyclic codes of odd length over $R$. A new Gray map over $R$ is defined and a sufficient and necessary condition for the existence of dual-containing cyclic codes over $R$ is given. A new family of $2^{m}$-ary quantum codes is obtained via the Gray map and the Calderbank-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06674","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"}