Please use this identifier to cite or link to this item: http://cmuir.cmu.ac.th/jspui/handle/6653943832/66706
Full metadata record
DC FieldValueLanguage
dc.contributor.authorYonglin Caoen_US
dc.contributor.authorYuan Caoen_US
dc.contributor.authorHai Q. Dinhen_US
dc.contributor.authorFang Wei Fuen_US
dc.contributor.authorJian Gaoen_US
dc.contributor.authorSongsak Sriboonchittaen_US
dc.date.accessioned2019-09-16T12:55:54Z-
dc.date.available2019-09-16T12:55:54Z-
dc.date.issued2019-01-01en_US
dc.identifier.issn02194988en_US
dc.identifier.other2-s2.0-85070193939en_US
dc.identifier.other10.1142/S0219498820501030en_US
dc.identifier.urihttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85070193939&origin=inwarden_US
dc.identifier.urihttp://cmuir.cmu.ac.th/jspui/handle/6653943832/66706-
dc.description.abstract© 2020 World Scientific Publishing Company. Let pm be a finite field of cardinality pm, where p is an odd prime, k,λ be positive integers satisfying λ ≥ 2, and denote = pm[x]/(f(x)λpk), where f(x) is an irreducible polynomial in pm[x]. In this note, for any fixed invertible element ω ×, we present all distinct linear codes S over of length 2 satisfying the condition: (ωf(x)pka1,a0) S for all (a0,a1) S. This conclusion can be used to determine the structure of (δ + αu2)-constacyclic codes over the finite chain ring pm[u]/(u2λ) of length npk for any positive integer n satisfying gcd(p,n) = 1.en_US
dc.subjectMathematicsen_US
dc.titleA class of linear codes of length 2 over finite chain ringsen_US
dc.typeJournalen_US
article.title.sourcetitleJournal of Algebra and its Applicationsen_US
article.stream.affiliationsChern Institute of Mathematicsen_US
article.stream.affiliationsTon-Duc-Thang Universityen_US
article.stream.affiliationsShandong University of Technologyen_US
article.stream.affiliationsChangsha University of Science and Technologyen_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.