{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,20]],"date-time":"2025-04-20T04:30:27Z","timestamp":1745123427346},"reference-count":4,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/isit.2004.1365092","type":"proceedings-article","created":{"date-parts":[[2004,12,23]],"date-time":"2004-12-23T04:34:17Z","timestamp":1103776457000},"page":"55-55","source":"Crossref","is-referenced-by-count":2,"title":["Interleavers for turbo codes that yield a minimum distance growing with blocklength"],"prefix":"10.1109","author":[{"given":"J.J.","family":"Boutros","sequence":"first","affiliation":[]},{"given":"G.","family":"Zemor","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013821922527"},{"key":"ref3","article-title":"Toward an Algebraic Theory for Turbo Codes","author":"tanner","year":"2000","journal-title":"Proc Int Symp Turbo Codes Brest"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1995.525138"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.831763"}],"event":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","location":"Chicago, Illinois, USA"},"container-title":["International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9423\/29909\/01365092.pdf?arnumber=1365092","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,13]],"date-time":"2017-03-13T22:51:41Z","timestamp":1489445501000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1365092\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":4,"URL":"https:\/\/doi.org\/10.1109\/isit.2004.1365092","relation":{},"subject":[]}}