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: | , , , |
|---|---|
| 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 |
| Summary: | © 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 3 · 2sℓm, that generalizes the construction of [15] (2016), which is the special case of m = 1. In addition, as an application, the characterization and enumeration of all linear complementary dual cyclic codes of length 6ℓmps over Fq are obtained. |
|---|