Repeated-root constacyclic codes of length 3ℓ<sup>m</sup>p<sup>s</sup>
© 2020 AIMS. Let p be a prime different from 3, and ℓ be an odd prime different from 3 and p. In terms of generator polynomials, structures of constacyclic codes and their duals of length 3ℓmps over Fq are established, where q is a power of p. We discuss the enumeration of all cyclic codes of length...
Saved in:
Main Authors: | Yan Liu, Minjia Shi, Hai Q. Dinh, Songsak Sriboonchitta |
---|---|
Format: | Journal |
Published: |
2020
|
Subjects: | |
Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85086666745&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/70462 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
Similar Items
-
On the Hamming distances of repeated-root constacyclic codes of length 4p <sup>s</sup>
by: Hai Q. Dinh, et al.
Published: (2019) -
On the symbol-pair distances of repeated-root constacyclic codes of length 2p<sup>s</sup>
by: H. Q. Dinh, et al.
Published: (2019) -
On constacyclic codes of length 4p<sup>s</sup>over F<inf>p<sup>m</sup></inf>+uF<inf>p<sup>m</sup></inf>
by: Hai Q. Dinh, et al.
Published: (2018) -
On constacyclic codes of length 4p<sup>s</sup>over F<inf>p<sup>m</sup></inf>+uF<inf>p<sup>m</sup></inf>
by: Hai Q. Dinh, et al.
Published: (2018) -
Hamming distance of repeated-root constacyclic codes of length 2 p<sup>s</sup> over F<sup>pm</sup>+uF<sup>pm</sup>
by: Hai Q. Dinh, et al.
Published: (2020)