{"paper":{"title":"Relative two-weight $\\mathbb{Z}_2 \\mathbb{Z}_4$-additive Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"C. Durairajan, N. Annamalai","submitted_at":"2016-09-30T11:01:40Z","abstract_excerpt":"In this paper, we study a relative two-weight $\\mathbb{Z}_2 \\mathbb{Z}_4$-additive codes. It is shown that the Gray image of a two-distance $\\mathbb{Z}_2 \\mathbb{Z}_4$-additive code is a binary two-distance code and that the Gray image of a relative two-weight $\\mathbb{Z}_2 \\mathbb{Z}_4$-additive code, with nontrivial binary part, is a linear binary relative two-weight code. The structure of relative two-weight $\\mathbb{Z}_2 \\mathbb{Z}_4$-additive codes are described. Finally, we discussed permutation automorphism group of a $\\mathbb{Z}_2 \\mathbb{Z}_4$-additive codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.09669","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"}