{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:54:06Z","timestamp":1742997246976,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642539312"},{"type":"electronic","value":"9783642539329"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-53932-9_47","type":"book-chapter","created":{"date-parts":[[2013,12,20]],"date-time":"2013-12-20T00:54:07Z","timestamp":1387500847000},"page":"477-487","source":"Crossref","is-referenced-by-count":0,"title":["A High-Efficient Distance Spectrum Algorithm for Turbo Codes"],"prefix":"10.1007","author":[{"given":"Sun-Ting","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shou-Sheu","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"47_CR1","doi-asserted-by":"crossref","unstructured":"Berrou, C., Glavieux, A., Thitimajshima, P.: Near Shannon Limit Error-Correcting Coding and Decoding: Turbo-codes. In: Proc. IEEE Int. Commun. Conf. Geneva, Switzerland, pp. 1064\u20131070 (1993)","DOI":"10.1109\/ICC.1993.397441"},{"key":"47_CR2","first-page":"1","volume-title":"IEEE International Symposium on Signals, Circuits and Systems","author":"L. Trifina","year":"2009","unstructured":"Trifina, L.: Two Methods to Increase the Minimum Distance for Turbo Codes with QPP Interleavers. In: IEEE International Symposium on Signals, Circuits and Systems, pp. 1\u20134. IEEE Press, New York (2009)"},{"key":"47_CR3","first-page":"1","volume-title":"IEEE International Symposium on Signals, Circuits and Systems","author":"L. Trifina","year":"2009","unstructured":"Trifina, L., Gherca, L., Lupu, B., Rotopanescu, A.-M.: Modified \u2126\u2019 Metric for QPP Interleavers Depending on SNR. In: IEEE International Symposium on Signals, Circuits and Systems, pp. 1\u20134. IEEE Press, New York (2009)"},{"key":"47_CR4","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1109\/49.924864","volume":"19","author":"R. Garello","year":"2001","unstructured":"Garello, R., Pierleoni, P., Benetto, S.: Computing the Free Distance of Turbo Codes and Serially Concatenated Codes with Interleavers: Algorithms and Applications. IEEE J. Sel. Areas Commun.\u00a019, 800\u2013812 (2001)","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"6","key":"47_CR5","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1109\/49.29615","volume":"7","author":"M. Rouanne","year":"1989","unstructured":"Rouanne, M., Costello, D.J.: An Algorithm for Computing the Distance Spectrum of Trellis Codes. IEEE J. Sel. Areas Commun.\u00a07(6), 929\u2013940 (1989)","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"6","key":"47_CR6","doi-asserted-by":"publisher","first-page":"1698","DOI":"10.1109\/18.556666","volume":"42","author":"L.C. Perez","year":"1996","unstructured":"Perez, L.C., Seghers, J., Costello, D.J.: A Distance Spectrum Interpretation of Turbo Codes. IEEE Trans. Inf. Theory\u00a042(6), 1698\u20131709 (1996)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"47_CR7","unstructured":"Breiling, M., Huber, J.: A Method for Determining the Distance Profile of Turbo Codes. In: Proc. Third ITG Conf. on Source and Channel Coding, pp. 219\u2013224 (2000)"},{"key":"47_CR8","doi-asserted-by":"crossref","unstructured":"Scalise, S., Bae, Y.K., Ernst, H.: A Fast Algorithm to Estimate the Distance Spectrum of Turbo Codes. In: Int. Conf. Telecomm. pp. 90\u201395 (2003)","DOI":"10.1109\/ICTEL.2003.1191183"},{"key":"47_CR9","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1109\/LCOMM.2004.835320","volume":"8","author":"Y. Wu","year":"2004","unstructured":"Wu, Y., Ogiwara, H.: Symbol-interleaver Design for Turbo Trellis-Coded Modulation. IEEE Commun. Lett.\u00a08, 632\u2013634 (2004)","journal-title":"IEEE Commun. Lett."},{"key":"47_CR10","doi-asserted-by":"crossref","unstructured":"Sakai, T., Shibata, K.: A Distance Spectrum Estimation Method of Turbo Codes. In: Int. Symp. on Inf. Theory and its Applic., Auckland, New Zealand (2008)","DOI":"10.1109\/ISITA.2008.4895620"},{"key":"47_CR11","doi-asserted-by":"crossref","unstructured":"Benedetto, S., Montorsi, G.: Unveiling Turbo Codes: Some Results on Parallel Concatenated Coding Schemes. IEEE Trans. Inf. Theory, 409\u2013428 (1996)","DOI":"10.1109\/18.485713"},{"key":"47_CR12","doi-asserted-by":"publisher","first-page":"1146","DOI":"10.1109\/18.45271","volume":"35","author":"M.L. Cedervall","year":"1989","unstructured":"Cedervall, M.L., Johannesson, R.: A Fast Algorithm for Computing Distance Spectrum of Convolutional Codes. IEEE Trans. Inf. Theory\u00a035, 1146\u20131159 (1989)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"47_CR13","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1109\/LCOMM.2012.020212.112529","volume":"16","author":"B. Matuz","year":"2012","unstructured":"Matuz, B.: On the Distance Spectrum of Tail-Biting Repeat-Accumulate Codes. IEEE Commun. Lett.\u00a016, 518\u2013521 (2012)","journal-title":"IEEE Commun. Lett."},{"key":"47_CR14","first-page":"1","volume-title":"IEEE International Symposium on Information Theory","author":"H. Zhou","year":"2012","unstructured":"Zhou, H., Mitchell, D.G.M., Goertz, N., Costello, D.J.: Distance Spectrum Estimation of LDPC Convolutional Codes. In: IEEE International Symposium on Information Theory, pp. 1\u20134. IEEE Press, New York (2012)"},{"key":"47_CR15","doi-asserted-by":"crossref","unstructured":"Ould-Cheikh-Mouhamedou, Y.: A Simple and Efficient Method for Lowering the Error Floors of Turbo Codes that Use Structured Interleavers, vol. 16, pp. 392\u2013395 (2012)","DOI":"10.1109\/LCOMM.2011.122211.112165"}],"container-title":["Communications in Computer and Information Science","Information Computing and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-53932-9_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,5]],"date-time":"2019-08-05T01:23:43Z","timestamp":1564968223000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-53932-9_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642539312","9783642539329"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-53932-9_47","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2013]]}}}