Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHai Q. Dinhen_US
dc.contributor.authorTushar Bagen_US
dc.contributor.authorPramod Kumar Kewaten_US
dc.contributor.authorSachin Pathaken_US
dc.contributor.authorAshish K. Upadhyayen_US
dc.contributor.authorWarattaya Chinnakumen_US
dc.description.abstractFor any prime p and positive integer m, let R be the finite commutative ring Fpm+uFpm+vFpm+uvFpm, whereu2= 0 , v2= 0 and uv= vu. Let λ= λ1+ uλ2+ vλ3+ uvλ4 be a unit of R, where λ1,λ2,λ3,λ4∈Fpm and λ1≠ 0. We know that λ-constacyclic codes of length ps over R are exactly ideals of the ring R[x]⟨xps-λ⟩. For all possible values of λ, we study λ-constacyclic codes of length ps over R. We also extend structures of codes from single alphabet to mixed alphabet, and determine separable constacyclic codes of length (pr, ps) over FpmR.en_US
dc.titleConstacyclic codes of length (p<sup>r</sup>, p<sup>s</sup>) over mixed alphabetsen_US
article.title.sourcetitleJournal of Applied Mathematics and Computingen_US
article.volume67en_US Institute of Technology Patnaen_US Universityen_US Institute of Technology (Indian School of Mines), Dhanbaden_US Hindu Universityen_US 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.