{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T14:46:05Z","timestamp":1758120365816},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"5-6","license":[{"start":{"date-parts":[[2013,3,13]],"date-time":"2013-03-13T00:00:00Z","timestamp":1363132800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann. Telecommun."],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1007\/s12243-013-0360-0","type":"journal-article","created":{"date-parts":[[2013,3,12]],"date-time":"2013-03-12T00:25:08Z","timestamp":1363047908000},"page":"251-272","source":"Crossref","is-referenced-by-count":17,"title":["Improved method for searching interleavers from a certain set using Garello\u2019s method with applications for the LTE standard"],"prefix":"10.1007","volume":"69","author":[{"given":"Lucian","family":"Trifina","sequence":"first","affiliation":[]},{"given":"Daniela","family":"Tarniceriu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,3,13]]},"reference":[{"issue":"5","key":"360_CR1","doi-asserted-by":"crossref","first-page":"800","DOI":"10.1109\/49.924864","volume":"19","author":"R Garello","year":"2001","unstructured":"Garello R, Pierleoni P, Benedetto S (2001) Computing the free distance of turbo codes and serially concatenated codes with interleavers: algorithms and applications. IEEE J Sel Areas Commun 19(5):800\u2013812","journal-title":"IEEE J Sel Areas Commun"},{"key":"360_CR2","doi-asserted-by":"crossref","unstructured":"Trifina L, Tarniceriu D, Munteanu V. Improved QPP interleavers for LTE Standard, IEEE International Symposium on Signals, Circuits and Systems (ISSCS 2011), Iasi, Romania, pp. 403\u2013406, June 30\u2013July 1, 2011.","DOI":"10.1109\/ISSCS.2011.5978745"},{"key":"360_CR3","unstructured":"3GPP TS36.212, v8.3.0 (2008\u201305), Multiplexing and channel coding"},{"issue":"1","key":"360_CR4","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1109\/TIT.2004.839478","volume":"51","author":"J Sun","year":"2005","unstructured":"Sun J, Takeshita OY (2005) Interleavers for turbo codes using permutation polynomial over integers rings. IEEE Trans Inf Theory 51(1):101\u2013119","journal-title":"IEEE Trans Inf Theory"},{"issue":"3","key":"360_CR5","doi-asserted-by":"crossref","first-page":"1249","DOI":"10.1109\/TIT.2005.864450","volume":"52","author":"OY Takeshita","year":"2006","unstructured":"Takeshita OY (2006) On maximum contention-free interleavers and permutation polynomials over integers rings. IEEE Trans Inf Theory 52(3):1249\u20131253","journal-title":"IEEE Trans Inf Theory"},{"issue":"3","key":"360_CR6","doi-asserted-by":"crossref","first-page":"1254","DOI":"10.1109\/TIT.2005.864442","volume":"52","author":"J Ryu","year":"2006","unstructured":"Ryu J, Takeshita OY (2006) On quadratic inverses for quadratic permutation polynomials over integers rings. IEEE Trans Inf Theory 52(3):1254\u20131260","journal-title":"IEEE Trans Inf Theory"},{"issue":"6","key":"360_CR7","doi-asserted-by":"crossref","first-page":"2116","DOI":"10.1109\/TIT.2007.896870","volume":"53","author":"OY Takeshita","year":"2007","unstructured":"Takeshita OY (2007) Permutation polynomial interleavers: an algebraic\u2013geometric perspective. IEEE Trans Inf Theory 53(6):2116\u20132132","journal-title":"IEEE Trans Inf Theory"},{"key":"360_CR8","doi-asserted-by":"crossref","unstructured":"Rosnes E, Takeshita OY (2006) Optimum distance quadratic permutation polynomial-based interleavers for turbo codes, Proc. IEEE International Symposium on Information Theory (ISIT 2006), Seattle, USA, pp. 1988\u20131992.","DOI":"10.1109\/ISIT.2006.261897"},{"issue":"10","key":"360_CR9","doi-asserted-by":"crossref","first-page":"1600","DOI":"10.1109\/TCOMM.2002.803971","volume":"50","author":"J Yuan","year":"2002","unstructured":"Yuan J, Feng W, Vucetic B (2002) Performance of parallel and serial concatenated codes on fading channels. IEEE Trans Commun 50(10):1600\u20131608","journal-title":"IEEE Trans Commun"},{"key":"360_CR10","unstructured":"http:\/\/www.tlc.polito.it\/garello\/turbodistance\/turbodistance.html"},{"issue":"11\u201312","key":"360_CR11","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1007\/s12243-009-0120-3","volume":"64","author":"D Tarniceriu","year":"2009","unstructured":"Tarniceriu D, Trifina L, Munteanu V (2009) About minimum distance for QPP interleavers. Ann Telecommun 64(11\u201312):745\u2013751","journal-title":"Ann Telecommun"},{"issue":"3","key":"360_CR12","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1109\/LCOMM.2010.03.091695","volume":"14","author":"H Zhao","year":"2010","unstructured":"Zhao H, Fan P, Tarokh V (2010) On the equivalence of interleavers for turbo codes using quadratic permutation polynomials over integer rings. IEEE Commun Lett 14(3):236\u2013238","journal-title":"IEEE Commun Lett"},{"key":"360_CR13","doi-asserted-by":"crossref","unstructured":"Trifina L, Tarniceriu D (2013) Analysis of cubic permutation polynomials for turbo codes. Wireless Person Comm 69(1):1\u201322","DOI":"10.1007\/s11277-012-0557-y"},{"issue":"7","key":"360_CR14","doi-asserted-by":"crossref","first-page":"4781","DOI":"10.1109\/TIT.2012.2192095","volume":"58","author":"E Rosnes","year":"2012","unstructured":"Rosnes E (2012) On the minimum distance of turbo codes with quadratic permutation polynomial interleavers. IEEE Trans Inf Theory 58(7):4781\u20134795","journal-title":"IEEE Trans Inf Theory"},{"key":"360_CR15","first-page":"1017","volume":"2","author":"C Berrou","year":"2002","unstructured":"Berrou C, Vaton S, Jezequel M, Douillard C (2002) Computing the minimum distance of linear codes by the error impulse method. IEEE Glob Telecommun Conf (GLOBECOM'02), Taipei Taiwan 2:1017\u20131020","journal-title":"IEEE Glob Telecommun Conf (GLOBECOM'02), Taipei Taiwan"},{"key":"360_CR16","doi-asserted-by":"crossref","unstructured":"Garello R, Vila-Casado A (2004) The all-zero iterative decoding algorithm for turbo code minimum distance computation. IEEE International Conference on Communications (ICC \u201804), Paris, France, pp.361\u2013364","DOI":"10.1109\/ICC.2004.1312511"},{"issue":"7","key":"360_CR17","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1109\/LCOMM.2005.1461687","volume":"9","author":"S Crozier","year":"2005","unstructured":"Crozier S, Guinand P, Hunt A (2005) Estimating the minimum distance of turbo-codes using double and triple impulse methods. IEEE Commun Lett 9(7):631\u2013633","journal-title":"IEEE Commun Lett"},{"issue":"5","key":"360_CR18","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1002\/ett.1185","volume":"18","author":"S Crozier","year":"2007","unstructured":"Crozier S, Guinand P, Hunt A (2007) Estimating the minimum distance of large-block turbo codes using iterative multiple-impulse methods. Eur Trans Telecommun 18(5):437\u2013444","journal-title":"Eur Trans Telecommun"}],"container-title":["annals of telecommunications - annales des t\u00e9l\u00e9communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12243-013-0360-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12243-013-0360-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12243-013-0360-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,10]],"date-time":"2019-07-10T21:53:13Z","timestamp":1562795593000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12243-013-0360-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,13]]},"references-count":18,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["360"],"URL":"https:\/\/doi.org\/10.1007\/s12243-013-0360-0","relation":{},"ISSN":["0003-4347","1958-9395"],"issn-type":[{"value":"0003-4347","type":"print"},{"value":"1958-9395","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3,13]]}}}