Please use this identifier to cite or link to this item: http://cmuir.cmu.ac.th/jspui/handle/6653943832/74722
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHai Q. Dinhen_US
dc.contributor.authorJamal Laaouineen_US
dc.contributor.authorBrahim Boudineen_US
dc.contributor.authorWoraphon Yamakaen_US
dc.date.accessioned2022-10-16T06:48:20Z-
dc.date.available2022-10-16T06:48:20Z-
dc.date.issued2022-07-01en_US
dc.identifier.issn22277390en_US
dc.identifier.other2-s2.0-85136229222en_US
dc.identifier.other10.3390/math10142496en_US
dc.identifier.urihttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85136229222&origin=inwarden_US
dc.identifier.urihttp://cmuir.cmu.ac.th/jspui/handle/6653943832/74722-
dc.description.abstractLet p be an odd prime, where (Formula presented.) and m are positive integers. Let (Formula presented.) be a nonzero element of the finite field (Formula presented.), where (Formula presented.), and (Formula presented.). In this paper, we determine completely the symbol-triple distances of all (Formula presented.) -constacyclic codes of length (Formula presented.) over (Formula presented.).en_US
dc.subjectComputer Scienceen_US
dc.subjectEngineeringen_US
dc.subjectMathematicsen_US
dc.titleSymbol-Triple Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths over F<inf>q</inf> +uF<inf>q</inf>+u<sup>2</sup>F<inf>q</inf>en_US
dc.typeJournalen_US
article.title.sourcetitleMathematicsen_US
article.volume10en_US
article.stream.affiliationsKent State Universityen_US
article.stream.affiliationsFaculté des Sciences Dhar El Mahraz, Université Sidi Mohamed Ben Abdellahen_US
article.stream.affiliationsChiang Mai Universityen_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.