{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,3]],"date-time":"2023-02-03T05:52:45Z","timestamp":1675403565470},"reference-count":9,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2017,2]]},"abstract":"<jats:p> Motivated by a generalization of the football pool problem, we introduce additive cyclic codes over mixed alphabets of the form [Formula: see text] where [Formula: see text], [Formula: see text] for distinct primes [Formula: see text]. We study their algebraic properties, generating sets, and duals. Additionally, we give examples of additive cyclic codes over the alphabet [Formula: see text] that have best-known or optimal parameters. <\/jats:p>","DOI":"10.1142\/s1793830917500100","type":"journal-article","created":{"date-parts":[[2016,12,27]],"date-time":"2016-12-27T05:33:15Z","timestamp":1482816795000},"page":"1750010","source":"Crossref","is-referenced-by-count":2,"title":["Additive cyclic codes over mixed alphabets and the football pool problem"],"prefix":"10.1142","volume":"09","author":[{"given":"Taher","family":"Abualrub","sequence":"first","affiliation":[{"name":"Department of Mathematics and Statistics, American University of Sharjah, Sharjah, UAE"},{"name":"Department of Mathematics and Statistics, Kenyon College, Gambier, OH, USA"}]},{"given":"N.","family":"Aydin","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Statistics, American University of Sharjah, Sharjah, UAE"},{"name":"Department of Mathematics and Statistics, Kenyon College, Gambier, OH, USA"}]}],"member":"219","published-online":{"date-parts":[[2017,2,6]]},"reference":[{"key":"S1793830917500100BIB001","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2299791"},{"key":"S1793830917500100BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/j.aml.2010.11.003"},{"key":"S1793830917500100BIB003","doi-asserted-by":"publisher","DOI":"10.12785\/amis\/070617"},{"key":"S1793830917500100BIB004","doi-asserted-by":"publisher","DOI":"10.1109\/18.904549"},{"key":"S1793830917500100BIB005","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1996.0125"},{"key":"S1793830917500100BIB006","doi-asserted-by":"publisher","DOI":"10.1109\/18.651001"},{"key":"S1793830917500100BIB007","doi-asserted-by":"publisher","DOI":"10.1109\/18.681315"},{"key":"S1793830917500100BIB008","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1991-1079013-8"},{"key":"S1793830917500100BIB009","doi-asserted-by":"publisher","DOI":"10.2307\/2974552"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830917500100","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T13:05:04Z","timestamp":1565096704000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830917500100"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2]]},"references-count":9,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2017,2,6]]},"published-print":{"date-parts":[[2017,2]]}},"alternative-id":["10.1142\/S1793830917500100"],"URL":"https:\/\/doi.org\/10.1142\/s1793830917500100","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2]]}}}