{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T20:10:09Z","timestamp":1777666209332,"version":"3.51.4"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1109\/tit.2012.2192095","type":"journal-article","created":{"date-parts":[[2012,4,11]],"date-time":"2012-04-11T15:40:03Z","timestamp":1334158803000},"page":"4781-4795","source":"Crossref","is-referenced-by-count":23,"title":["On the Minimum Distance of Turbo Codes With Quadratic Permutation Polynomial Interleavers"],"prefix":"10.1109","volume":"58","author":[{"given":"Eirik","family":"Rosnes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref32","author":"gathen","year":"1999","journal-title":"Modern Computer Algebra"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.vlsi.2010.07.001"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1117\/12.591043"},{"key":"ref10","first-page":"169","article-title":"Distance upper bounds and true minimum distance results for turbo-codes designed with DRP interleavers","author":"crozier","year":"2003","journal-title":"Proc 3rd Int Symp Turbo Codes Related Topics"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.896870"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/LCOM.2006.224416"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365089"},{"key":"ref14","first-page":"137","article-title":"High-throughput turbo decoding techniques for 4G","author":"blankenship","year":"2002","journal-title":"Proc Int l Conf 3G Wireless and Beyond"},{"key":"ref15","year":"2008","journal-title":"3rd generation partnership project technical specification group radio access network evolved universal terrestrial radio access (E-UTRA) multiplexing and channel coding (Release 8) 3GPP TS 36 212 v8 5 0"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261897"},{"key":"ref17","first-page":"389","article-title":"Trellis termination for turbo encoders","author":"guinand","year":"1994","journal-title":"Proc 17th Biennial Symp Commun"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2008.187"},{"key":"ref19","first-page":"329","article-title":"Calculating the minimum distance of linear block codes via integer programming","author":"punekar","year":"2010","journal-title":"Proc 6th Int Symp Turbo Codes Iterative Inf Process"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023356"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2004.1312507"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013821922527"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864450"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.868474"},{"key":"ref29","first-page":"439","article-title":"Estimating the minimum distance of large-block turbo codes using the event impulse method","author":"crozier","year":"2010","journal-title":"Proc 6th Int Symp Turbo Codes Iterative Inf Process"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/49.924867"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1995.525138"},{"key":"ref7","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\/TIT.2004.839478"},{"key":"ref9","first-page":"306","article-title":"Computing the minimum distance of turbo-codes using iterative decoding techniques","author":"crozier","year":"2004","journal-title":"Proc 22th Biennial Symp Commun"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1993.397441"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"1254","DOI":"10.1109\/TIT.2005.864442","article-title":"On quadratic inverses for quadratic permutation polynomials over integer rings","volume":"52","author":"ryu","year":"2006","journal-title":"IEEE Trans Inf Theory"},{"key":"ref22","author":"lin","year":"2004","journal-title":"Error Control Coding Fundamentals and Applications"},{"key":"ref21","author":"ryu","year":"2007","journal-title":"Permutation polynomial based interleavers for turbo codes over integer rings Theory and applications"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2005.1461687"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.840632"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.831763"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838358"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/6216490\/06175129.pdf?arnumber=6175129","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,11,13]],"date-time":"2017-11-13T21:18:50Z","timestamp":1510607930000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6175129\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":32,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tit.2012.2192095","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7]]}}}