{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:00:15Z","timestamp":1772283615571,"version":"3.50.1"},"reference-count":22,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2008,12,1]],"date-time":"2008-12-01T00:00:00Z","timestamp":1228089600000},"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":[[2008,12]]},"DOI":"10.1109\/tit.2008.2006430","type":"journal-article","created":{"date-parts":[[2008,12,1]],"date-time":"2008-12-01T21:30:00Z","timestamp":1228167000000},"page":"5770-5773","source":"Crossref","is-referenced-by-count":11,"title":["An Explicit Construction of <i>$2$<\/i>-Generator Quasi-Twisted Codes"],"prefix":"10.1109","volume":"54","author":[{"given":"Eric Z.","family":"Chen","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011283523000"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.815798"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(03)00126-2"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.333889"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.890727"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1112\/blms\/18.2.97"},{"key":"ref16","author":"berlekamp","year":"1984","journal-title":"Algebraic Coding Theory"},{"key":"ref17","author":"sguin","year":"1990","journal-title":"The theory of 1-generator quasi-cyclic codes"},{"key":"ref18","author":"grassl","year":"0","journal-title":"Bounds on the minimum distance of linear codes"},{"key":"ref19","author":"chen","year":"0","journal-title":"Web Database of Binary QC Codes"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.809501"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055262"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.79911"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055929"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/18.623167"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.333888"},{"key":"ref2","first-page":"130","article-title":"long quasi-cyclic codes are good","volume":"13","author":"weldon jr","year":"1970","journal-title":"IEEE Trans Inf Theory"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(69)90497-5"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/18.705580"},{"key":"ref20","author":"chen","year":"0","journal-title":"Web Database of Two-Weight Codes"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/18.144719"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557332"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/4675712\/04675723.pdf?arnumber=4675723","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:47:24Z","timestamp":1638218844000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4675723\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12]]},"references-count":22,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tit.2008.2006430","relation":{},"ISSN":["0018-9448"],"issn-type":[{"value":"0018-9448","type":"print"}],"subject":[],"published":{"date-parts":[[2008,12]]}}}