{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,3]],"date-time":"2024-03-03T10:57:58Z","timestamp":1709463478094},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,8,17]],"date-time":"2017-08-17T00:00:00Z","timestamp":1502928000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Wireless Pers Commun"],"published-print":{"date-parts":[[2018,1]]},"DOI":"10.1007\/s11277-017-4869-9","type":"journal-article","created":{"date-parts":[[2017,8,17]],"date-time":"2017-08-17T08:31:52Z","timestamp":1502958712000},"page":"271-291","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Performance of M\u00f6bius Interleavers for Turbo Codes"],"prefix":"10.1007","volume":"98","author":[{"given":"Seyyedali","family":"Hosseinalipour","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amin","family":"Sakzad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad-Reza","family":"Sadeghi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,17]]},"reference":[{"key":"4869_CR1","doi-asserted-by":"crossref","unstructured":"Berrou, C., Glavieux, A., & Thitimajshima, P. (1993). Near Shannon limit error-correcting coding and decoding: Turbo codes. In Proceedings of international conference on communications (pp.\u00a01064\u20131070).","DOI":"10.1109\/ICC.1993.397441"},{"key":"4869_CR2","doi-asserted-by":"crossref","first-page":"1732","DOI":"10.1109\/TIT.2006.871061","volume":"52","author":"JJ Boutros","year":"2006","unstructured":"Boutros, J. J., & Zemor, G. (2006). On quasi-cyclic interleavers for parallel turbo codes. IEEE Transactions on Information Theory, 52, 1732\u20131739.","journal-title":"IEEE Transactions on Information Theory"},{"key":"4869_CR3","doi-asserted-by":"crossref","first-page":"1692","DOI":"10.1109\/TIT.2004.831763","volume":"50","author":"M Breiling","year":"2004","unstructured":"Breiling, M. (2004). A logarithmic upper bound on the minimum distance of turbo codes. IEEE Transactions on Information Theory, 50, 1692\u20131710.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"4869_CR4","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1016\/j.ffa.2007.08.003","volume":"14","author":"A Cesmelioglu","year":"2008","unstructured":"Cesmelioglu, A., Meidl, W., & Topuzoglu, A. (2008). On the cycle structure of permutation polynomials. Finite Fields and Their Applications, 14(3), 593\u2013614.","journal-title":"Finite Fields and Their Applications"},{"key":"4869_CR5","unstructured":"Corrada-Bravo, C. J., & Rubio, I. (2003). Deterministic interleavers for turbo codes with random-like performance and simple implementation. In Proceedings of 3rd international symposium on turbo codes, Brest, France."},{"issue":"1\u20132","key":"4869_CR6","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1007\/BF03219805","volume":"60","author":"S Crozier","year":"2005","unstructured":"Crozier, S., & Guinand, P. (2005). Distance upper bounds and true minimum distance results for turbo codes designed with DRP interleavers. Springer Annales Des Tellecommunications, 60(1\u20132), 10\u201328.","journal-title":"Springer Annales Des Tellecommunications"},{"issue":"7","key":"4869_CR7","doi-asserted-by":"crossref","first-page":"2336","DOI":"10.1109\/18.887848","volume":"46","author":"F Daneshgaran","year":"2000","unstructured":"Daneshgaran, F., & Mondin, M. (2000). Permutation fixed points with applicat-ion to estimation of minimum distance of turbo codes. IEEE Transactions on Information Theory, 46(7), 2336\u20132349.","journal-title":"IEEE Transactions on Information Theory"},{"key":"4869_CR8","doi-asserted-by":"crossref","unstructured":"Divsalar, D., & Pollara, F. (1995). Turbo codes for PCS applications. In Proceedings of international conference on communications, Seattle, WA.","DOI":"10.1109\/ICC.1995.525138"},{"issue":"5","key":"4869_CR9","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 Journal on Selected Areas in Communications, 19(5), 800\u2013812.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"4869_CR10","doi-asserted-by":"crossref","unstructured":"Hosseinalipour, S., Sakzad, A., & Sadeghi, M.-R. (2015). Minimum free distance of $$\\text{CCSDS}$$ CCSDS turbo encoders under (truncated) M\u00f6bius interleavers. In Proceedings of 3rd Iran workshop on communication and information theory (IWCIT) 2015, Tehran, Iran (pp.\u00a01\u20136).","DOI":"10.1109\/IWCIT.2015.7140212"},{"key":"4869_CR11","unstructured":"LTE; Evolved Universal Terrestrial Radio Access (E-UTRA); Multiplexing and channel coding (3GPP TS 36.212 version 8.8.0 Release 8) (2010\u201301). Technical specification, European Telecommunications Standards Institute (ETSI)."},{"key":"4869_CR12","doi-asserted-by":"crossref","DOI":"10.1201\/b15006","volume-title":"Handbook of finite fields","author":"GL Mullen","year":"2013","unstructured":"Mullen, G. L., & Panario, D. (2013). Handbook of finite fields. Boca Raton: Chapman and Hall\/CRC."},{"key":"4869_CR13","unstructured":"Nimbalker, A., Blankenship, Y., Classon, B., & Blankenship, T. K. (2008). ARP and QPP interleavers for LTE turbo coding, wireless communications and networking conference, 2008. WCNC 2008. IEEE (pp.\u00a01032\u20131037)."},{"issue":"12","key":"4869_CR14","doi-asserted-by":"crossref","first-page":"2985","DOI":"10.1109\/TIT.2004.838358","volume":"50","author":"A Perotti","year":"2004","unstructured":"Perotti, A., & Benedetto, S. (2004). A new upper bound on the minimum distance of turbo codes. IEEE Transactions on Information Theory, 50(12), 2985\u20132997.","journal-title":"IEEE Transactions on Information Theory"},{"key":"4869_CR15","unstructured":"Report Concerning Space Data System Standards: TM synchronization and channel coding summary of concept and rationale (2012).\u00a0Informational Report CCSDS 130.1 -G-2, Green Book. Consultative Committee for Space Data Systems, Green Book."},{"issue":"7","key":"4869_CR16","doi-asserted-by":"crossref","first-page":"4581","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 Transactions on Information Theory, 58(7), 4581\u20134795.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"4869_CR17","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1109\/TCOMM.2004.840632","volume":"53","author":"E Rosnes","year":"2005","unstructured":"Rosnes, E., & Ytrehus, O. (2005). Improved algorithms for the determination of turbo code weight distributions. IEEE Transactions on Communications, 53(1), 20\u201326.","journal-title":"IEEE Transactions on Communications"},{"issue":"3","key":"4869_CR18","doi-asserted-by":"crossref","first-page":"1254","DOI":"10.1109\/TIT.2005.864442","volume":"52","author":"J Ryu","year":"2006","unstructured":"Ryu, J., & Takeshita, O. Y. (2006). On quadratic inverses for quadratic permutation polynomials over integer rings. IEEE Transactions on Information Theory, 52(3), 1254\u20131260.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"4869_CR19","doi-asserted-by":"crossref","first-page":"347","DOI":"10.3934\/amc.2012.6.347","volume":"6","author":"A Sakzad","year":"2012","unstructured":"Sakzad, A., Sadeghi, M.-R., & Panario, D. (2012). Cycle structure of permutation functions over finite fields and their applications. Advances in Mathematics of Communications, 6(3), 347\u2013361.","journal-title":"Advances in Mathematics of Communications"},{"key":"4869_CR20","doi-asserted-by":"crossref","unstructured":"Sakzad, A., Panario, D., Sadeghi, M.-R., & Eshghi, N. (2010). Self-inverse interleavers based on permutation functions for turbo codes. In Proceedings of 48th annual Allerton conference on communications, control, and computing, Allerton, Chicago, USA (pp.\u00a022\u201328).","DOI":"10.1109\/ALLERTON.2010.5706883"},{"issue":"1","key":"4869_CR21","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1109\/TIT.2004.839478","volume":"51","author":"J Sun","year":"2005","unstructured":"Sun, J., & Takeshita, O. Y. (2005). Interleavers for turbo codes using permutation polynomials over integer rings. IEEE Transactions on Information Theory, 51(1), 101\u2013119.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"4869_CR22","doi-asserted-by":"crossref","first-page":"1249","DOI":"10.1109\/TIT.2005.864450","volume":"52","author":"OY Takeshita","year":"2006","unstructured":"Takeshita, O. Y. (2006). On maximum contention-free interleavers and permutation polynomials over integer rings. IEEE Transactions on Information Theory, 52(3), 1249\u20131253.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"4869_CR23","doi-asserted-by":"crossref","first-page":"2116","DOI":"10.1109\/TIT.2007.896870","volume":"53","author":"OY Takeshita","year":"2007","unstructured":"Takeshita, O. Y. (2007). Permutation polynomial interleavers: An algebraic geometric perspective. IEEE Transactions on Information Theory, 53(6), 2116\u20132132.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"4869_CR24","doi-asserted-by":"crossref","first-page":"1988","DOI":"10.1109\/18.868474","volume":"46","author":"OY Takeshita","year":"2000","unstructured":"Takeshita, O. Y., & Costello, D. J. (2000). New deterministic interleaver designs for turbo codes. IEEE Transactions on Information Theory, 46(6), 1988\u20132006.","journal-title":"IEEE Transactions on Information Theory"},{"key":"4869_CR25","doi-asserted-by":"crossref","unstructured":"Trifina, L., Munteanu, V., & Tarniceriu, D. (2009). Two methods to increase the minimum distance for turbo codes with QPP interleavers. In International symposium on signals, circuits and systems (pp.\u00a01\u20134).","DOI":"10.1109\/ISSCS.2009.5206138"},{"key":"4869_CR26","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1023\/A:1013821922527","volume":"37","author":"DV Truhachev","year":"2001","unstructured":"Truhachev, D. V., Lentmaier, M., & Zigangirov, K Sh. (2001). Some results concerning design and decoding of turbo-codes. Problems of Information Transmission, 37, 190\u2013205.","journal-title":"Problems of Information Transmission"},{"issue":"1","key":"4869_CR27","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1049\/iet-com:20060007","volume":"1","author":"S Vafi","year":"2007","unstructured":"Vafi, S., & Wysocki, T. (2007). Weight distribution of turbo codes with convolutional interleavers. IET Communications, 1(1), 71\u201378.","journal-title":"IET Communications"},{"issue":"6","key":"4869_CR28","doi-asserted-by":"crossref","first-page":"1323","DOI":"10.1109\/JPROC.2007.897975","volume":"95","author":"B Vucetic","year":"2007","unstructured":"Vucetic, B., Li, Y., Perez, L. C., & Jiang, F. (2007). Recent advances in turbo code design and theory. Proceedings of the IEEE, 95(6), 1323\u20131344.","journal-title":"Proceedings of the IEEE"},{"key":"4869_CR29","volume-title":"Error control systems for digital communications and storage","author":"SB Wicker","year":"1995","unstructured":"Wicker, S. B. (1995). Error control systems for digital communications and storage. New Jersey: Prentice Hall."}],"container-title":["Wireless Personal Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11277-017-4869-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-017-4869-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-017-4869-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T09:10:20Z","timestamp":1659345020000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11277-017-4869-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,17]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["4869"],"URL":"https:\/\/doi.org\/10.1007\/s11277-017-4869-9","relation":{},"ISSN":["0929-6212","1572-834X"],"issn-type":[{"value":"0929-6212","type":"print"},{"value":"1572-834X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,8,17]]}}}