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: | Yonglin Cao, Yuan Cao, Hai Q. Dinh, Fang Wei Fu, Paravee Maneejuk |
---|---|
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 |
Similar Items
-
Repeated-root constacyclic codes of prime power lengths over finite chain rings
by: Hai Q. Dinh, et al.
Published: (2018) -
Repeated-root constacyclic codes of prime power lengths over finite chain rings
by: Hai Q. Dinh, et al.
Published: (2018) -
A class of repeated-root constacyclic codes over F<inf>p<sup>m</sup></inf>[u]/〈u<sup>e</sup>〉 of Type 2
by: Yuan Cao, et al.
Published: (2018) -
Repeated-root constacyclic codes of prime power lengths over finite chain rings
by: Dinh H., et al.
Published: (2017) -
Repeated-root constacyclic codes of length 2ℓmpn
by: Chen, Bocong, et al.
Published: (2015)