On matrix-product structure of repeated-root constacyclic codes over finite fields
© 2019 Elsevier B.V. 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 λ0pk-constacyclic code of length pkn over the finite field Fpm is monomially equivalent to a matrix-product...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Journal |
| Published: |
2020
|
| Subjects: | |
| Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85076694051&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/68453 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Chiang Mai University |
| Summary: | © 2019 Elsevier B.V. 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 λ0pk-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. |
|---|