Please use this identifier to cite or link to this item:
http://cmuir.cmu.ac.th/jspui/handle/6653943832/70462
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Yan Liu | en_US |
dc.contributor.author | Minjia Shi | en_US |
dc.contributor.author | Hai Q. Dinh | en_US |
dc.contributor.author | Songsak Sriboonchitta | en_US |
dc.date.accessioned | 2020-10-14T08:31:19Z | - |
dc.date.available | 2020-10-14T08:31:19Z | - |
dc.date.issued | 2020-01-01 | en_US |
dc.identifier.issn | 19305338 | en_US |
dc.identifier.issn | 19305346 | en_US |
dc.identifier.other | 2-s2.0-85086666745 | en_US |
dc.identifier.other | 10.3934/amc.2020025 | en_US |
dc.identifier.uri | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85086666745&origin=inward | en_US |
dc.identifier.uri | http://cmuir.cmu.ac.th/jspui/handle/6653943832/70462 | - |
dc.description.abstract | © 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. | en_US |
dc.subject | Computer Science | en_US |
dc.subject | Mathematics | en_US |
dc.title | Repeated-root constacyclic codes of length 3ℓ<sup>m</sup>p<sup>s</sup> | en_US |
dc.type | Journal | en_US |
article.title.sourcetitle | Advances in Mathematics of Communications | en_US |
article.volume | 14 | en_US |
article.stream.affiliations | Ton-Duc-Thang University | en_US |
article.stream.affiliations | Anhui University | en_US |
article.stream.affiliations | Chiang Mai University | en_US |
Appears in Collections: | CMUL: Journal Articles |
Files in This Item:
There are no files associated with this item.
Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.