{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,11]],"date-time":"2024-05-11T05:19:32Z","timestamp":1715404772401},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2004,8,1]],"date-time":"2004-08-01T00:00:00Z","timestamp":1091318400000},"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":[[2004,8]]},"DOI":"10.1109\/tit.2004.831763","type":"journal-article","created":{"date-parts":[[2004,7,27]],"date-time":"2004-07-27T13:49:45Z","timestamp":1090936185000},"page":"1692-1710","source":"Crossref","is-referenced-by-count":52,"title":["A logarithmic upper bound on the minimum distance of turbo codes"],"prefix":"10.1109","volume":"50","author":[{"given":"M.","family":"Breiling","sequence":"first","affiliation":[{"name":"Lehrstuhl fur Nachrichtentechnik, Univ. Erlangen-Nurnberg, Erlangen, Germany"}]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003833"},{"key":"ref30","author":"wozencraft","year":"1965","journal-title":"Principles of Communication Engineering"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1049\/el:20000953"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1054053"},{"key":"ref12","author":"kahale","year":"1997","journal-title":"On the Minimum Distance of Parallel and Serially Concatenated Codes"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055688"},{"key":"ref14","first-page":"55","article-title":"upper bound on the minimum distance of turbo codes using a combinatorial approach","author":"breiling","year":"2000","journal-title":"Proc Int Symp Turbo Codes"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/18.959256"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1049\/el:19940897"},{"key":"ref17","author":"breiling","year":"2002","journal-title":"Analysis and design of turbo code interleavers"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-60985-5"},{"key":"ref19","author":"chartrand","year":"1986","journal-title":"Graphs & Digraphs"},{"key":"ref28","author":"macwilliams","year":"1977","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref4","author":"gallager","year":"1968","journal-title":"Information Theory and Reliable Communication"},{"key":"ref27","author":"wiberg","year":"1996","journal-title":"Codes and decoding on general graphs"},{"key":"ref3","first-page":"1","article-title":"variance of the turbo-code performance bound over the interleavers","volume":"46","author":"mohammadi","year":"2000","journal-title":"IEEE Trans on Inform Theory"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.1994.512991"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/49.924864"},{"key":"ref29","author":"proakis","year":"1989","journal-title":"Digital Communications"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/26.764936"},{"key":"ref7","first-page":"56","author":"dolinar","year":"1995","journal-title":"Weight distributions for turbo codes using random and nonrandom permutations"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.485713"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2000.866749"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1993.397441"},{"key":"ref20","author":"bollob\u00e1s","year":"1978","journal-title":"Extremal Graph Theory"},{"key":"ref22","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low Density Parity-Check Codes"},{"key":"ref21","author":"regev","year":"1995","journal-title":"On Graphs of Large Girth"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/26.923804"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/18.556666"},{"key":"ref26","author":"ge","year":"1999","journal-title":"The distribution of cycle lengths in graphical models for iterative decoding"},{"key":"ref25","article-title":"some results concerning design and decoding of turbo-codes","volume":"37","author":"truhachev","year":"2001","journal-title":"Probl Pered Inform"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/29198\/01317115.pdf?arnumber=1317115","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:46:47Z","timestamp":1638218807000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1317115\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,8]]},"references-count":31,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tit.2004.831763","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,8]]}}}