{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T20:56:34Z","timestamp":1648846594926},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,8,28]],"date-time":"2009-08-28T00:00:00Z","timestamp":1251417600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIViP"],"published-print":{"date-parts":[[2010,11]]},"DOI":"10.1007\/s11760-009-0130-7","type":"journal-article","created":{"date-parts":[[2009,8,27]],"date-time":"2009-08-27T08:51:46Z","timestamp":1251363106000},"page":"405-408","source":"Crossref","is-referenced-by-count":2,"title":["An improved methodology to design rate compatible punctured turbo codes"],"prefix":"10.1007","volume":"4","author":[{"given":"Lazcano-Salas","family":"Saul","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Garc\u00eda-Ugalde","family":"Francisco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,8,28]]},"reference":[{"key":"130_CR1","doi-asserted-by":"crossref","unstructured":"Berrou, C., Glavieux, A., Thitimaishida, P.: Near Shannon limit error-correcting coding and decoding: turbo codes. In: Proceedings of IEEE International Conference on Communications, vol. 2, pp. 1064\u20131070. Geneva (1993)","DOI":"10.1109\/ICC.1993.397441"},{"issue":"7","key":"130_CR2","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1049\/el:19950406","volume":"31","author":"A.S. Barbulescu","year":"1995","unstructured":"Barbulescu A.S., Pietrobon S.S.: Rate compatible turbo codes. IEE Electron. Lett. 31(7), 535\u2013536 (1995)","journal-title":"IEE Electron. Lett."},{"issue":"9","key":"130_CR3","doi-asserted-by":"crossref","first-page":"1315","DOI":"10.1109\/26.789667","volume":"47","author":"\u00d6.F. A\u00e7ikel","year":"1999","unstructured":"A\u00e7ikel \u00d6.F., Ryan W.E.: Punctured turbo-codes for BPSK\/QPSK channels. IEEE Trans. Commun. 47(9), 1315\u20131323 (1999)","journal-title":"IEEE Trans. Commun."},{"issue":"6","key":"130_CR4","doi-asserted-by":"crossref","first-page":"948","DOI":"10.1109\/26.848555","volume":"48","author":"D.N. Rowitch","year":"2000","unstructured":"Rowitch D.N., Milstein L.B.: On the performance of hybrid FEC\/ARQ systems using rate-compatible punctured turbo (RCPT) codes. IEEE Trans. Commun. 48(6), 948\u2013959 (2000)","journal-title":"IEEE Trans. Commun."},{"issue":"4","key":"130_CR5","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1109\/26.2763","volume":"36","author":"J. Hagenauer","year":"1988","unstructured":"Hagenauer J.: Rate-compatible punctured convolutional codes (RCPC codes) and their applications. IEEE Trans. Commun. 36(4), 389\u2013400 (1988)","journal-title":"IEEE Trans. Commun."},{"key":"130_CR6","doi-asserted-by":"crossref","unstructured":"Rosnes, E., Ytrehus, O.: On the construction of good families of rate compatible punctured turbo codes. In: IEEE Conference Proceeding of International Symposium on Information Theory 2005, ISIT 2005, 4\u20139 September 2005, pp 602\u2013606","DOI":"10.1109\/ISIT.2005.1523406"},{"issue":"5","key":"130_CR7","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1109\/TCOMM.2004.826237","volume":"52","author":"F. Babich","year":"2004","unstructured":"Babich F., Montorsi G., Vatta F.: Some notes on rate-compatible punctured turbo codes (RCPTC) design. IEEE Trans. Commun. 52(5), 681\u2013684 (2004)","journal-title":"IEEE Trans. Commun."},{"key":"130_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0477-1","volume-title":"Turbo codes, desirable and designable","author":"A. Giulietti","year":"2004","unstructured":"Giulietti A., Bougard B., Vander Perre L.: Turbo codes, desirable and designable. Kluwer, Boston (2004)"},{"key":"130_CR9","doi-asserted-by":"crossref","DOI":"10.1002\/0470035706","volume-title":"The art of error correcting coding","author":"R. Morelos-Zaragoza","year":"2006","unstructured":"Morelos-Zaragoza R.: The art of error correcting coding, 2nd edn. Wiley, Chichester (2006)","edition":"2"},{"issue":"5","key":"130_CR10","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.: Computing the free distance of turbo codes and serially concatenated codes with interleavers: Algorithms and applications. IEEE J. Select. Areas Commun. 19(5), 800\u2013812 (2001)","journal-title":"IEEE J. Select. Areas Commun."},{"key":"130_CR11","unstructured":"3GPP, Technical specification group: multiplexing and channel coding (TDD), TS 125. 212 V6.7.0 December 2005"},{"key":"130_CR12","volume-title":"Turbo codes, principles and applications","author":"B. Vucetic","year":"2002","unstructured":"Vucetic B., Jinhong Y.: Turbo codes, principles and applications. Kluwer, Boston (2002)"},{"key":"130_CR13","doi-asserted-by":"crossref","unstructured":"Wang, D., Kobayashi, H.: On design of interleavers with practical size for turbo codes. In: IEEE International Conference on Communications, 2000, ICC 2000, vol. 2, pp. 618\u2013622, 18\u201322 June 2000","DOI":"10.1109\/ICC.2000.853570"},{"key":"130_CR14","doi-asserted-by":"crossref","unstructured":"Crozier, S., Guinand, P.: High performance low-memory interleavers banks for turbo codes. In: IEEE 54th Vehicular Technology Conference, VTC Fall 2001, Atlantic City, 7\u201311 October 2001","DOI":"10.1109\/VTC.2001.957178"},{"key":"130_CR15","unstructured":"Crozier, S., Guinand, P., Hunt, A: On designing Turbo codes with data puncturing. In: 2005 Canadian Workshop on Information Theory (CWIT 2005) Proceedings, Montreal, 5\u20138 June 2005"}],"container-title":["Signal, Image and Video Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11760-009-0130-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11760-009-0130-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11760-009-0130-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:42:07Z","timestamp":1559410927000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11760-009-0130-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8,28]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,11]]}},"alternative-id":["130"],"URL":"https:\/\/doi.org\/10.1007\/s11760-009-0130-7","relation":{},"ISSN":["1863-1703","1863-1711"],"issn-type":[{"value":"1863-1703","type":"print"},{"value":"1863-1711","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,8,28]]}}}