{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,20]],"date-time":"2024-09-20T16:26:12Z","timestamp":1726849572253},"reference-count":8,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2018,8]]},"abstract":"<jats:p> [Formula: see text]-additive codes for any integer [Formula: see text] are considered as codes over mixed alphabets. They are a generalization of binary linear codes and linear codes over [Formula: see text] In this paper, we are interested in studying [Formula: see text]-additive cyclic codes. We will give the generator polynomials of these codes. We will also give the minimal spanning sets for these codes. We will define separable [Formula: see text]-additive codes and provide conditions on the generator polynomials for a [Formula: see text]-additive cyclic code to be separable. Finally, we present some examples of optimal parameter binary codes obtained as images of [Formula: see text]-additive cyclic codes. <\/jats:p>","DOI":"10.1142\/s1793830918500489","type":"journal-article","created":{"date-parts":[[2018,4,24]],"date-time":"2018-04-24T04:24:33Z","timestamp":1524543873000},"page":"1850048","source":"Crossref","is-referenced-by-count":6,"title":["The structure of \u21242\u21242s-additive cyclic codes"],"prefix":"10.1142","volume":"10","author":[{"given":"Ismail","family":"Aydogdu","sequence":"first","affiliation":[{"name":"Department of Mathematics, Yildiz Technical University, Istanbul, Turkey"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Taher","family":"Abualrub","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Statistics, American University of Sharjah, Sharjah, UAE"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2018,7,30]]},"reference":[{"key":"S1793830918500489BIB001","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2299791"},{"key":"S1793830918500489BIB002","doi-asserted-by":"publisher","DOI":"10.1080\/00207160.2013.859854"},{"key":"S1793830918500489BIB003","doi-asserted-by":"publisher","DOI":"10.12785\/amis\/070617"},{"key":"S1793830918500489BIB004","doi-asserted-by":"publisher","DOI":"10.1080\/03081087.2014.952728"},{"key":"S1793830918500489BIB005","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-009-9316-9"},{"key":"S1793830918500489BIB006","doi-asserted-by":"publisher","DOI":"10.1007\/BF01390768"},{"key":"S1793830918500489BIB007","doi-asserted-by":"publisher","DOI":"10.1109\/18.681328"},{"key":"S1793830918500489BIB010","author":"Rif\u00e0 H.","year":"2010","journal-title":"Comput. Res. Reposit."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830918500489","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T08:44:46Z","timestamp":1565081086000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830918500489"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,30]]},"references-count":8,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2018,7,30]]},"published-print":{"date-parts":[[2018,8]]}},"alternative-id":["10.1142\/S1793830918500489"],"URL":"https:\/\/doi.org\/10.1142\/s1793830918500489","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7,30]]}}}