On matrix-product structure of repeated-root constacyclic codes over finite fields
https://doi.org/10.1016/j.disc.2019.111768Publisher, magazine: ,
Publication year: 2020
Lưu Trích dẫn Chia sẻAbstract
For any prime number p, positive integers m,k,n, where n satisfies gcd(p,n)=1, and for any non-zero element λ0 of the finite field Fpm of cardinality pm, we prove that any λpk0-constacyclic code of length pkn over the finite field Fpm is monomially equivalent to a matrix-product code of a nested sequence of pkλ0-constacyclic codes with length n over Fpm. As an application, we completely determine the Hamming distances of all negacyclic codes of length 7⋅2l over F7 for any integer l≥3.
Tags: repeated-root constacyclic code; matrix-product code; monomially equivalent codes; finite chain ring
Các bài viết liên quan đến tác giả Yonglin Cao
On matrix-product structure of repeated-root constacyclic codes over finite fields
Construction and enumeration for self-dual cyclic codes of even length over F2m+uF2m