{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:07:49Z","timestamp":1760144869250,"version":"build-2065373602"},"reference-count":29,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2024,5,28]],"date-time":"2024-05-28T00:00:00Z","timestamp":1716854400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Axioms"],"abstract":"<jats:p>In this note, we study skew cyclic and skew constacyclic codes over the mixed alphabet R=FqR1R2, where q=pm, p is an odd prime with m odd and R1=Fq+uFq with u2=u, and R2=Fq+uFq+vFq with u2=u,v2=v,uv=vu=0. Such codes consist of the juxtaposition of three codes of the same size over Fq,R1, and R2, respectively. We investigate the generator polynomial for skew cyclic codes over R. Furthermore, we discuss the structural properties of the skew cyclic and skew constacyclic codes over R. We also study their q-ary images under suitable Gray maps.<\/jats:p>","DOI":"10.3390\/axioms13060360","type":"journal-article","created":{"date-parts":[[2024,5,28]],"date-time":"2024-05-28T07:38:39Z","timestamp":1716881919000},"page":"360","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Skew Cyclic and Skew Constacyclic Codes over a Mixed Alphabet"],"prefix":"10.3390","volume":"13","author":[{"given":"Karthick","family":"Gowdhaman","sequence":"first","affiliation":[{"name":"Department of Mathematics, Presidency University, Bengaluru 560064, Karnataka, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7433-3241","authenticated-orcid":false,"given":"Cruz","family":"Mohan","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Bishop Heber College, Bharathidasan University, Tiruchirapalli 620017, Tamil Nadu, India"}]},{"given":"Chinnapillai","family":"Durairajan","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Bharathidasan University, Tiruchirapalli 620024, Tamil Nadu, India"}]},{"given":"Selda","family":"\u00c7alkavur","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Faculty of Arts and Science, Kocaeli University, Kocaeli 41001, Turkey"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4078-8301","authenticated-orcid":false,"given":"Patrick","family":"Sol\u00e9","sequence":"additional","affiliation":[{"name":"I2M, Aix Marseille University, CNRS, 13009 Marseille, France"}]}],"member":"1968","published-online":{"date-parts":[[2024,5,28]]},"reference":[{"key":"ref_1","unstructured":"Bose, R.C., and Dowling, T.A. (1969). Combinatorial Mathematics, University of North Carolian Press."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/s00200-007-0043-z","article-title":"Skew cyclic codes","volume":"18","author":"Boucher","year":"2007","journal-title":"Appl. Algebra Eng. Comm."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"273","DOI":"10.3934\/amc.2008.2.273","article-title":"Skew constacyclic codes over Galois rings","volume":"2","author":"Boucher","year":"2011","journal-title":"Adv. Math. Commun."},{"key":"ref_4","first-page":"10","article-title":"Skew cyclic codes of arbitrary length","volume":"2","author":"Siap","year":"2011","journal-title":"Int. J. Inf. Coding Theory"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"39","DOI":"10.3934\/amc.2012.6.39","article-title":"Skew constacyclic codes over finite chain ring","volume":"6","author":"Jitman","year":"2012","journal-title":"Adv. Math. Commun."},{"key":"ref_6","first-page":"115","article-title":"On \u03b8-cyclic codes over F2+vF2","volume":"54","author":"Abualrub","year":"2012","journal-title":"Aust. J. Comb."},{"key":"ref_7","first-page":"218","article-title":"Skew cyclic codes F3+vF3","volume":"24","author":"Ashraf","year":"2014","journal-title":"Int. J. Inf. Coding Theory"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"313","DOI":"10.3934\/amc.2014.8.313","article-title":"Construction of skew cyclic codes over Fq+vFq","volume":"8","author":"Gursoy","year":"2014","journal-title":"Adv. Math. Commun."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1850072","DOI":"10.1142\/S1793557118500729","article-title":"Skew cyclic codes Fq+uFq+vFq","volume":"115","author":"Ashraf","year":"2018","journal-title":"Asian-Eur. J. Math."},{"key":"ref_10","first-page":"215","article-title":"Skew cyclic codes over Fq+uFq+vFq+uvFq","volume":"2","author":"Dertli","year":"2017","journal-title":"J. Sci. Arts"},{"key":"ref_11","first-page":"163","article-title":"On Skew cyclic codes over Fq+uFq+vFq+uvFq","volume":"2","author":"Yao","year":"2015","journal-title":"J. Algebra Comb. Discret. Struct. Appl."},{"key":"ref_12","first-page":"286","article-title":"Skew constacyclic codes over the ring Fq+vFq","volume":"6","author":"Gao","year":"2017","journal-title":"Appl. Comput. Math."},{"key":"ref_13","first-page":"101","article-title":"Skew cyclic and skew (\u03b11+u\u03b12+v\u03b13+uv\u03b14)-constacyclic codes over Fq+uFq+vFq+uvFq","volume":"5","author":"Islam","year":"2018","journal-title":"Int. J. Inf. Coding Theory"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1950030","DOI":"10.1142\/S1793830919500307","article-title":"A note on skew constacyclic codes over Fq+uFq+vFq","volume":"11","author":"Islam","year":"2019","journal-title":"Discret. Math. Algorithms Appl."},{"key":"ref_15","unstructured":"Bhardwaj, S., and Raka, M. (2019). Skew constacyclic codes over a non-chain ring Fq[u,v]\/\u2329f(u),g(v),uv-vu\u232a. arXiv."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/s10623-009-9316-9","article-title":"z2z4-linear codes: Generator matrices and duality","volume":"54","author":"Borges","year":"2010","journal-title":"Des. Codes Cryptogr."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s10623-009-9340-9","article-title":"zzz4-linear codes: Rank and kernel","volume":"56","author":"Pujol","year":"2010","journal-title":"Des. Codes Cryptogr."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"425","DOI":"10.3934\/amc.2011.5.425","article-title":"zzz4-additive perfect codes in steganography","volume":"5","author":"Rifa","year":"2011","journal-title":"Adv. Math. Commun."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"2271","DOI":"10.12785\/amis\/070617","article-title":"The structure of Z2Z2s-additive codes: Bounds on the minimum distance","volume":"7","author":"Aydogdu","year":"2013","journal-title":"Appl. Math. Inf. Sci."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"2089","DOI":"10.1080\/03081087.2014.952728","article-title":"On ZprZps-additive codes","volume":"63","author":"Aydogdu","year":"2015","journal-title":"Linear Multilinear Algebra"},{"key":"ref_21","first-page":"3842","article-title":"On ZpZpk-additive codes and their duality","volume":"65","author":"Shi","year":"2018","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/s12095-019-00397-z","article-title":"ZpZps-additive cyclic codes are asymptotically good","volume":"12","author":"Yao","year":"2020","journal-title":"Cryptogr. Commun."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"101633","DOI":"10.1016\/j.ffa.2020.101633","article-title":"Asymptotically good ZprZps-additive cyclic codes","volume":"63","author":"Yao","year":"2020","journal-title":"Finite Fields Appl."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"1508","DOI":"10.1109\/TIT.2014.2299791","article-title":"Z2Z4-Additive cyclic codes","volume":"60","author":"Abualrub","year":"2014","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"6348","DOI":"10.1109\/TIT.2016.2611528","article-title":"Z2Z4-additive cyclic codes, generator polynomials and dual codes","volume":"62","author":"Borges","year":"2016","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"1806","DOI":"10.1080\/00207160.2013.859854","article-title":"On Z2Z2[u]-additive codes","volume":"92","author":"Aydogdu","year":"2015","journal-title":"Int. J. Comput. Math."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"4883","DOI":"10.1109\/TIT.2016.2632163","article-title":"The Z2Z2[u]-cyclic and constacyclic codes","volume":"63","author":"Aydogdu","year":"2016","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"1793","DOI":"10.1142\/S1793830916500270","article-title":"The Z2(Z2+uZ2)-additive cyclic codes and their duals","volume":"8","author":"Srinivasulu","year":"2016","journal-title":"Discret. Math. Algorithms Appl."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"1644","DOI":"10.1016\/j.jsc.2007.11.008","article-title":"Coding with skew polynomial rings","volume":"44","author":"Boucher","year":"2009","journal-title":"J. Symb. Comput."}],"container-title":["Axioms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2075-1680\/13\/6\/360\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T14:49:36Z","timestamp":1760107776000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2075-1680\/13\/6\/360"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,28]]},"references-count":29,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2024,6]]}},"alternative-id":["axioms13060360"],"URL":"https:\/\/doi.org\/10.3390\/axioms13060360","relation":{},"ISSN":["2075-1680"],"issn-type":[{"type":"electronic","value":"2075-1680"}],"subject":[],"published":{"date-parts":[[2024,5,28]]}}}