{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T00:01:26Z","timestamp":1752192086035,"version":"3.41.2"},"reference-count":10,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[1973,11,1]],"date-time":"1973-11-01T00:00:00Z","timestamp":120960000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1973,11,1]],"date-time":"1973-11-01T00:00:00Z","timestamp":120960000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1973,11,1]],"date-time":"1973-11-01T00:00:00Z","timestamp":120960000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[1973,11]]},"DOI":"10.1109\/tit.1973.1055090","type":"journal-article","created":{"date-parts":[[2004,4,27]],"date-time":"2004-04-27T14:27:04Z","timestamp":1083076024000},"page":"820-823","source":"Crossref","is-referenced-by-count":4,"title":["On some classes of cyclic codes of composite length (Corresp.)"],"prefix":"10.1109","volume":"19","author":[{"given":"C.","family":"Hartmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Tzeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Encoding and decoding cyclic code groups","year":"1967","author":"abramson","key":"ref4"},{"key":"ref3","first-page":"78","article-title":"A bound on d<subscript>min<\/subscript> for cyclic codes","volume":"2","author":"korzhik","year":"1966","journal-title":"Probl Peredach Inform"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054816"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1968.1054233"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1054016"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055555"},{"journal-title":"Information Processing 68","year":"1969","author":"assmus","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1965.1053802"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054761"},{"journal-title":"Some cyclic codes of block length 3p","year":"1963","author":"assmus","key":"ref1"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/22672\/01055090.pdf?arnumber=1055090","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,9]],"date-time":"2025-07-09T23:17:26Z","timestamp":1752103046000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1055090\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1973,11]]},"references-count":10,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.1973.1055090","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[1973,11]]}}}