For any prime number $p$, positive integers $m, k, n$ satisfying ${\rm gcd}(p,n)=1$ and $λ_0\in \mathbb{F}_{p^m}^\times$, we prove that any $λ_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$ $λ_0$-constacyclic codes with length $n$ over $\mathbb{F}_{p^m}$.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。