{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:23:54Z","timestamp":1740122634748,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T00:00:00Z","timestamp":1498262400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61501479"],"award-info":[{"award-number":["61501479"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Natural Science Foundation of China (CN)","award":["61372098"],"award-info":[{"award-number":["61372098"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Wireless Pers Commun"],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1007\/s11277-017-4607-3","type":"journal-article","created":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T04:28:27Z","timestamp":1498278507000},"page":"2269-2282","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Design of Rate-Compatible QC-IRA-d Codes Based on Gaussian Approximation Analysis and Graph Extension"],"prefix":"10.1007","volume":"97","author":[{"given":"Jing","family":"Lei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erbao","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenwen","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,6,24]]},"reference":[{"issue":"4","key":"4607_CR1","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1109\/26.2763","volume":"36","author":"J Hagenauer","year":"1988","unstructured":"Hagenauer, J. (1988). Rate-compatible punctured convolutional codes (RCPCcodes) and their applications. IEEE Transactions on Communications, 36(4), 389\u2013400.","journal-title":"IEEE Transactions on Communications"},{"issue":"2","key":"4607_CR2","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1109\/TIT.2005.862118","volume":"52","author":"J Ha","year":"2006","unstructured":"Ha, J., Kim, J., Klinc, D., & McLaughlin, S. W. (2006). Rate-compatible punctured low-density parity-check codes with short block lengths. IEEE Transactions on Information Theory, 52(2), 728\u2013738.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"4607_CR3","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1109\/LCOMM.2012.112812.121785","volume":"17","author":"R Asvadi","year":"2013","unstructured":"Asvadi, R., & Banihashemi, A. H. (2013). A rate-compatible puncturing scheme for finite-length LDPC codes. IEEE Communications Letters, 17(1), 147\u2013150.","journal-title":"IEEE Communications Letters"},{"key":"4607_CR4","unstructured":"Li, J., & Narayanan, K. (2002). Rate-compatible low density parity check codes for capacity-approaching ARQ scheme in packet data communications. In International conference on communications, internet, and information technology (CIIT)."},{"issue":"3","key":"4607_CR5","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1109\/LCOMM.2004.825728","volume":"8","author":"MR Yazdani","year":"2004","unstructured":"Yazdani, M. R., & Banihashemi, A. H. (2004). On construction of rate-compatible low-density parity-check codes. IEEE Communications Letters, 8(3), 159\u2013161.","journal-title":"IEEE Communications Letters"},{"issue":"1","key":"4607_CR6","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1109\/TIT.2004.839541","volume":"51","author":"XY Hu","year":"2005","unstructured":"Hu, X. Y., Eleftheriou, E., & Arnold, D. M. (2005). Regular and irregular progressive edge-growth tanner graphs. IEEE Transactions on Information Theory, 51(1), 386\u2013398.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"4607_CR7","doi-asserted-by":"crossref","first-page":"1153","DOI":"10.1109\/TCOMM.2007.898834","volume":"55","author":"G Yue","year":"2007","unstructured":"Yue, G., Wang, X., & Madihian, M. (2007). Design of rate-compatible irregular repeat accumulate codes. IEEE Transactions on Communications, 55(6), 1153\u20131163.","journal-title":"IEEE Transactions on Communications"},{"issue":"5","key":"4607_CR8","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1109\/LCOMM.2010.05.092141","volume":"14","author":"D Benmayor","year":"2010","unstructured":"Benmayor, D., Mathiopoulos, P. T., & Constantinou, P. (2010). Rate-compatible IRA codes using quadratic congruential extension sequences and puncturing. IEEE Communications Letters, 14(5), P12\u201315.","journal-title":"IEEE Communications Letters"},{"issue":"10","key":"4607_CR9","doi-asserted-by":"crossref","first-page":"2841","DOI":"10.1109\/TCOMM.2012.081012.110010","volume":"60","author":"TV Nguyen","year":"2012","unstructured":"Nguyen, T. V., Nosratinia, A., & Divsalar, D. (2012). The design of rate-compatible protograph LDPC codes. IEEE Transactions on Communications, 60(10), 2841\u20132850.","journal-title":"IEEE Transactions on Communications"},{"issue":"5","key":"4607_CR10","doi-asserted-by":"crossref","first-page":"948","DOI":"10.1109\/LCOMM.2013.031313.122046","volume":"17","author":"TV Nguyen","year":"2013","unstructured":"Nguyen, T. V., & Nosratinia, A. (2013). Rate-compatible short-length protograph LDPC codes. IEEE Communications Letters, 17(5), 948\u2013951.","journal-title":"IEEE Communications Letters"},{"issue":"12","key":"4607_CR11","first-page":"3624","volume":"57","author":"HG Joo","year":"2009","unstructured":"Joo, H. G., Hong, S. N., & Shin, D. J. (2009). Design of rate-compatible RA-type low-density parity-check codes using splitting. IEEE Transactions on Communications, 57(12), 3624\u20133628.","journal-title":"IEEE Transactions on Communications"},{"key":"4607_CR12","unstructured":"Beermann, M., & Vary, P. (2013). Breaking cycles with dummy bits: Improved rate-compatible LDPC codes with short block length. In Proceedings of 9th international ITG conference on SCC, pp. 1\u20136."},{"issue":"3","key":"4607_CR13","doi-asserted-by":"crossref","first-page":"1321","DOI":"10.1109\/TVT.2007.895603","volume":"56","author":"G Yue","year":"2007","unstructured":"Yue, G., Lu, B., & Wang, X. (2007). Analysis and design of finite-length LDPC codes. IEEE Transactions on Vehicular Technology, 56(3), 1321\u20131332.","journal-title":"IEEE Transactions on Vehicular Technology"},{"issue":"4","key":"4607_CR14","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1109\/LCOMM.2008.080065","volume":"12","author":"CM Huang","year":"2008","unstructured":"Huang, C. M., Huang, J. F., & Yang, C. C. (2008). Construction of quasi-cyclic LDPC codes from quadratic congruences. IEEE Communication Letters, 12(4), 313\u2013315.","journal-title":"IEEE Communication Letters"},{"issue":"11","key":"4607_CR15","doi-asserted-by":"crossref","first-page":"1224","DOI":"10.1109\/LCOMM.2011.090911.111545","volume":"15","author":"J Wang","year":"2011","unstructured":"Wang, J., Lei, J., Ni, S., Tang, X., & Ou, G. (2011). QC-IRA-d codes based on circulant permutation matrices. IEEE Communications Letters, 15(11), 1224\u20131227.","journal-title":"IEEE Communications Letters"},{"issue":"9","key":"4607_CR16","first-page":"103","volume":"29","author":"J Lei","year":"2008","unstructured":"Lei, J., Wang, J., & Tang, C. (2008). Quasi-cyclic extension based on PEG algorithm for construction of LDPC codes. Journal of Communication, 29(9), 103\u2013110.","journal-title":"Journal of Communication"},{"key":"4607_CR17","unstructured":"Richardson, T., & Urbanke, R. Multi-edge type LDPC codes, preprint [Online]. Available http\/\/\n                        www.ithcwww.epfl.ch\/papers\/multiedge.ps\n                        \n                    ."},{"issue":"1","key":"4607_CR18","first-page":"93","volume":"44","author":"C Hu","year":"2012","unstructured":"Hu, C., Wu, Z., Li, Z., & Wang, W. (2012). Construction of rate-compatible quasi-cyclic LDPC codes. Journal of Nanjing University of Aeronautics and Astronautics, 44(1), 93\u201399.","journal-title":"Journal of Nanjing University of Aeronautics and Astronautics"}],"container-title":["Wireless Personal Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11277-017-4607-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-017-4607-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-017-4607-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,31]],"date-time":"2017-10-31T06:12:51Z","timestamp":1509430371000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11277-017-4607-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,24]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,11]]}},"alternative-id":["4607"],"URL":"https:\/\/doi.org\/10.1007\/s11277-017-4607-3","relation":{},"ISSN":["0929-6212","1572-834X"],"issn-type":[{"type":"print","value":"0929-6212"},{"type":"electronic","value":"1572-834X"}],"subject":[],"published":{"date-parts":[[2017,6,24]]}}}