{"paper":{"title":"Matrix-product structure of repeated-root constacyclic codes over finite fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fang-Wei Fu, Yonglin Cao, Yuan Cao","submitted_at":"2017-05-24T15:33:01Z","abstract_excerpt":"For any prime number $p$, positive integers $m, k, n$ satisfying ${\\rm gcd}(p,n)=1$ and $\\lambda_0\\in \\mathbb{F}_{p^m}^\\times$, we prove that any $\\lambda_0^{p^k}$-constacyclic code of length $p^kn$ over the finite field $\\mathbb{F}_{p^m}$ is monomially equivalent to a matrix-product code of a nested sequence of $p^k$ $\\lambda_0$-constacyclic codes with length $n$ over $\\mathbb{F}_{p^m}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08819","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"}