{"paper":{"title":"Structure of linear codes over the ring $B_k$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Djoko Suprijanto, Irwansyah","submitted_at":"2017-10-10T05:14:24Z","abstract_excerpt":"We study the structure of linear codes over the ring $B_k$ which is defined by $\\mathbb{F}_{p^r}[v_1,v_2,\\ldots,v_k]/\\langle v_i^2=v_i,~v_iv_j=v_jv_i \\rangle_{i,j=1}^k.$ In order to study the codes, we begin with studying the structure of the ring $B_k$ via a Gray map which also induces a relation between codes over $B_k$ and codes over $\\mathbb{F}_{p^r}.$ We consider Euclidean and Hermitian self-dual codes, MacWilliams relations, as well as Singleton-type bounds for these codes. Further, we characterize cyclic and quasi-cyclic codes using their images under the Gray map, and give the generato"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.03403","kind":"arxiv","version":2},"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"}