{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T13:05:30Z","timestamp":1649077530564},"reference-count":15,"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":[[2019,2]]},"abstract":"<jats:p> Let [Formula: see text] be the ring [Formula: see text]. We study cyclic codes of arbitrary length [Formula: see text] over the ring [Formula: see text] and obtain a complete characterization for them by presenting a unique set of generators for these codes. For example, we try to determine all distinct cyclic codes of length [Formula: see text] over the ring [Formula: see text] by a practical algorithm. <\/jats:p>","DOI":"10.1142\/s1793830919500095","type":"journal-article","created":{"date-parts":[[2018,11,23]],"date-time":"2018-11-23T06:51:58Z","timestamp":1542955918000},"page":"1950009","source":"Crossref","is-referenced-by-count":0,"title":["Cyclic codes over R3,m"],"prefix":"10.1142","volume":"11","author":[{"given":"Hamidreza","family":"Mahmoodi","sequence":"first","affiliation":[{"name":"Department of Mathematics, University of Isfahan, P. O. Box: 81746-73441, Isfahan, Iran"}]}],"member":"219","published-online":{"date-parts":[[2019,2,8]]},"reference":[{"key":"S1793830919500095BIB001","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-006-9034-5"},{"key":"S1793830919500095BIB002","doi-asserted-by":"publisher","DOI":"10.1007\/s00200-013-0207-y"},{"key":"S1793830919500095BIB003","doi-asserted-by":"publisher","DOI":"10.1109\/18.761278"},{"key":"S1793830919500095BIB004","first-page":"121","volume":"6","author":"Calderbak A. R.","year":"1995","journal-title":"Des. codes Cryptogr."},{"key":"S1793830919500095BIB005","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2013015"},{"key":"S1793830919500095BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgebra.2010.05.027"},{"key":"S1793830919500095BIB007","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.831789"},{"key":"S1793830919500095BIB008","doi-asserted-by":"publisher","DOI":"10.1109\/18.746770"},{"key":"S1793830919500095BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2010.11.002"},{"key":"S1793830919500095BIB010","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-011-9539-4"},{"key":"S1793830919500095BIB011","doi-asserted-by":"publisher","DOI":"10.1109\/18.312154"},{"key":"S1793830919500095BIB012","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2013.11.017"},{"key":"S1793830919500095BIB014","doi-asserted-by":"publisher","DOI":"10.3906\/mat-1211-20"},{"key":"S1793830919500095BIB015","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-009-9309-8"},{"key":"S1793830919500095BIB016","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-010-9399-3"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830919500095","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T12:46:12Z","timestamp":1565181972000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830919500095"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2]]},"references-count":15,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2019,2,8]]},"published-print":{"date-parts":[[2019,2]]}},"alternative-id":["10.1142\/S1793830919500095"],"URL":"https:\/\/doi.org\/10.1142\/s1793830919500095","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2]]}}}