{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:58:58Z","timestamp":1760061538196,"version":"3.41.0"},"reference-count":8,"publisher":"World Scientific Pub Co Pte Ltd","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2015,12]]},"abstract":"<jats:p>Let [Formula: see text], where [Formula: see text] and [Formula: see text]. In this paper, minimum generating sets of cyclic codes over [Formula: see text] are given. A necessary and sufficient condition for cyclic codes over [Formula: see text] to be [Formula: see text]-free is obtained and a BCH-type bound on the minimum Hamming distance for them is also given.<\/jats:p>","DOI":"10.1142\/s1793830915500585","type":"journal-article","created":{"date-parts":[[2015,10,13]],"date-time":"2015-10-13T19:47:53Z","timestamp":1444765673000},"page":"1550058","source":"Crossref","is-referenced-by-count":8,"title":["Some results on cyclic codes over \u2124q + u\u2124q"],"prefix":"10.1142","volume":"07","author":[{"given":"Jian","family":"Gao","sequence":"first","affiliation":[{"name":"School of Science, Shandong University of Technology, Zibo 255091, P. R. China"}]},{"given":"Fang-Wei","family":"Fu","sequence":"additional","affiliation":[{"name":"Chern Institute of Mathematics and LPMC, Nankai University, Tianjin 300071, P. R. China"}]},{"given":"Ling","family":"Xiao","sequence":"additional","affiliation":[{"name":"School of Science, Shandong University of Technology, Zibo 255091, P. R. China"}]},{"given":"Rama Krishna","family":"Bandi","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Indian Institute of Technology Roorkee, Roorkee 247667, India"}]}],"member":"219","published-online":{"date-parts":[[2016,1,4]]},"reference":[{"key":"S1793830915500585BIB002","doi-asserted-by":"crossref","first-page":"1","DOI":"10.13069\/jacodesmath.31486","volume":"1","author":"Bayram A.","year":"2014","journal-title":"J. Algebra Combin. Discrete Appl."},{"key":"S1793830915500585BIB003","doi-asserted-by":"publisher","DOI":"10.1007\/s12190-014-0786-1"},{"key":"S1793830915500585BIB004","doi-asserted-by":"publisher","DOI":"10.1109\/18.312154"},{"key":"S1793830915500585BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpaa.2014.03.002"},{"key":"S1793830915500585BIB006","doi-asserted-by":"publisher","DOI":"10.1142\/5350"},{"key":"S1793830915500585BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2013.12.007"},{"key":"S1793830915500585BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2011.08.015"},{"key":"S1793830915500585BIB009","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2040896"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830915500585","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T00:54:24Z","timestamp":1748652864000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830915500585"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12]]},"references-count":8,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2016,1,4]]},"published-print":{"date-parts":[[2015,12]]}},"alternative-id":["10.1142\/S1793830915500585"],"URL":"https:\/\/doi.org\/10.1142\/s1793830915500585","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2015,12]]}}}