Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/156043
Full metadata record
DC FieldValueLanguage
dc.contributor.authorJitman, Somphongen_US
dc.contributor.authorLing, Sanen_US
dc.contributor.authorTharnnukhroh, Jareenaen_US
dc.date.accessioned2022-04-06T00:25:22Z-
dc.date.available2022-04-06T00:25:22Z-
dc.date.issued2022-
dc.identifier.citationJitman, S., Ling, S. & Tharnnukhroh, J. (2022). Type-II polyadic constacyclic codes over finite fields. Discrete Mathematics, Algorithms and Applications. https://dx.doi.org/10.1142/S1793830922500720en_US
dc.identifier.issn1793-8309en_US
dc.identifier.urihttps://hdl.handle.net/10356/156043-
dc.description.abstractPolyadic constacyclic codes over finite fields have been of interest due to their nice algebraic structures, good parameters, and wide applications. Recently, the study of Type-I m-adic constacyclic codes over finite fields has been established. In this paper, a family of Type-II m-adic constacyclic codes is investigated. The existence of such codes is determined using the length of orbits in a suitable group action. A necessary condition and a sufficient condition for a positive integer s to be a multiplier of a Type-II m-adic constacyclic code are determined. Subsequently, for a given positive integer m, a necessary condition and a sufficient condition for the existence of Type-II m-adic constacyclic codes are derived. In many cases, these conditions become both necessary and sufficient. For the other cases, determining necessary and sufficient conditions is equivalent to the discrete logarithm problem which is considered to be computationally intractable. Some special cases are investigated together with examples of Type-II polyadic constacyclic codes with good parameters.en_US
dc.description.sponsorshipNanyang Technological Universityen_US
dc.language.isoenen_US
dc.relation04INS000047C230GRT01en_US
dc.relation.ispartofDiscrete Mathematics, Algorithms and Applicationsen_US
dc.rights© 2022 World Scientific Publishing Company. All rights reserved.en_US
dc.subjectScience::Mathematics::Applied mathematics::Information theoryen_US
dc.subjectScience::Mathematics::Discrete mathematicsen_US
dc.titleType-II polyadic constacyclic codes over finite fieldsen_US
dc.typeJournal Articleen
dc.contributor.schoolSchool of Physical and Mathematical Sciencesen_US
dc.identifier.doi10.1142/S1793830922500720-
dc.subject.keywordsType-II Polyadic Constacyclic Codesen_US
dc.subject.keywordsCyclotomic Cosetsen_US
dc.description.acknowledgementThe research of S. Ling is partially supported by Nanyang Technological University Research Grant No. 04INS000047C230GRT01.en_US
item.grantfulltextnone-
item.fulltextNo Fulltext-
Appears in Collections:SPMS Journal Articles

Page view(s)

27
Updated on Jun 30, 2022

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.