{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T03:07:31Z","timestamp":1772680051197,"version":"3.50.1"},"reference-count":13,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2014,3,1]],"date-time":"2014-03-01T00:00:00Z","timestamp":1393632000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2014,3]]},"DOI":"10.1109\/tit.2014.2299791","type":"journal-article","created":{"date-parts":[[2014,1,31]],"date-time":"2014-01-31T17:50:19Z","timestamp":1391190619000},"page":"1508-1514","source":"Crossref","is-referenced-by-count":96,"title":["$\\BBZ_{2}\\BBZ_{4}$ -Additive Cyclic Codes"],"prefix":"10.1109","volume":"60","author":[{"given":"Taher","family":"Abualrub","sequence":"first","affiliation":[]},{"given":"Irfan","family":"Siap","sequence":"additional","affiliation":[]},{"given":"Nuh","family":"Aydin","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.312154"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032749"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/18.532906"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"425","DOI":"10.3934\/amc.2011.5.425","article-title":"<formula formulatype=\"inline\"> <tex Notation=\"TeX\">${\\rm Z}_{2}{\\rm Z}_{4}$<\/tex><\/formula> -additive perfect codes in steganography","volume":"5","author":"rif\ufffd-pous","year":"2011","journal-title":"Adv Math Commun"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-010-9437-1"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.815763"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1996.0125"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-009-9316-9"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/BF01390768"},{"key":"ref7","volume":"1","author":"brouwer","year":"1998","journal-title":"Bounds on the Size of Linear Codes in Handbook of Coding Theory"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838109"},{"key":"ref1","first-page":"195","article-title":"Reversible cyclic codes over <formula formulatype=\"inline\"><tex Notation=\"TeX\">$\\BBZ_{4}$<\/tex> <\/formula>","volume":"38","author":"abualrub","year":"2007","journal-title":"Austral J Combin"},{"key":"ref9","author":"grassl","year":"1995","journal-title":"Table of Bounds on Linear Codes"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6739111\/06710154.pdf?arnumber=6710154","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:29:50Z","timestamp":1642004990000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6710154\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3]]},"references-count":13,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tit.2014.2299791","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3]]}}}