{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T15:27:45Z","timestamp":1725463665748},"reference-count":5,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/isit.2004.1365350","type":"proceedings-article","created":{"date-parts":[[2004,12,23]],"date-time":"2004-12-23T09:34:17Z","timestamp":1103794457000},"page":"313-313","source":"Crossref","is-referenced-by-count":0,"title":["A new upper bound on the minimum distance of turbo codes"],"prefix":"10.1109","author":[{"given":"A.","family":"Perotti","sequence":"first","affiliation":[]},{"given":"S.","family":"Benedetto","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.831763"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2008114"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.1998.708611"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/49.924864"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1993.397441"}],"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\/01365350.pdf?arnumber=1365350","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,15]],"date-time":"2017-03-15T19:38:27Z","timestamp":1489606707000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1365350\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":5,"URL":"https:\/\/doi.org\/10.1109\/isit.2004.1365350","relation":{},"subject":[]}}