Please use this identifier to cite or link to this item: http://cmuir.cmu.ac.th/jspui/handle/6653943832/70711
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHai Q. Dinhen_US
dc.contributor.authorA. Gauren_US
dc.contributor.authorIndivar Guptaen_US
dc.contributor.authorAbhay K. Singhen_US
dc.contributor.authorManoj Kumar Singhen_US
dc.contributor.authorRoengchai Tansuchaten_US
dc.date.accessioned2020-10-14T08:39:45Z-
dc.date.available2020-10-14T08:39:45Z-
dc.date.issued2020-06-01en_US
dc.identifier.issn09381279en_US
dc.identifier.other2-s2.0-85084139448en_US
dc.identifier.other10.1007/s00200-020-00432-0en_US
dc.identifier.urihttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85084139448&origin=inwarden_US
dc.identifier.urihttp://cmuir.cmu.ac.th/jspui/handle/6653943832/70711-
dc.description.abstract© 2020, Springer-Verlag GmbH, DE. Let p be an odd prime, and δ be an arbitrary unit of the finite chain ring Fpm+uFpm(u2=0). The Hamming distances of all δ-constacyclic codes of length 2 ps over Fpm+uFpm are completely determined. We provide some examples from which some codes have better parameters than the existing ones. As applications, we determine all MDS repeated-root δ-constacyclic codes of length 2 ps over Fpm+uFpm.en_US
dc.subjectMathematicsen_US
dc.titleHamming distance of repeated-root constacyclic codes of length 2 p<sup>s</sup> over F<sup>pm</sup>+uF<sup>pm</sup>en_US
dc.typeJournalen_US
article.title.sourcetitleApplicable Algebra in Engineering, Communications and Computingen_US
article.volume31en_US
article.stream.affiliationsTon-Duc-Thang Universityen_US
article.stream.affiliationsUniversity of Delhien_US
article.stream.affiliationsDefence Research and Development Organisation Indiaen_US
article.stream.affiliationsIndian Institute of Technology (Indian School of Mines), Dhanbaden_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.