{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:24:13Z","timestamp":1740122653763,"version":"3.37.3"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,1,22]],"date-time":"2018-01-22T00:00:00Z","timestamp":1516579200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Natural Science Foundation of China (CN)","award":["61501479"],"award-info":[{"award-number":["61501479"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61372098"],"award-info":[{"award-number":["61372098"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Wireless Pers Commun"],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1007\/s11277-018-5342-0","type":"journal-article","created":{"date-parts":[[2018,1,22]],"date-time":"2018-01-22T13:21:01Z","timestamp":1516627261000},"page":"709-720","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["High Rate APPS and Bi-APPS LDPC Codes Design with Low Error Floor and Large Girth"],"prefix":"10.1007","volume":"100","author":[{"given":"Erbao","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Le","family":"Dong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"Lei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,22]]},"reference":[{"key":"5342_CR1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","volume-title":"Low-density parity check codes","author":"RG Gallager","year":"1963","unstructured":"Gallager, R. G. (1963). Low-density parity check codes. Cambridge, MA: MIT Press."},{"issue":"5","key":"5342_CR2","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1109\/TIT.1981.1056404","volume":"27","author":"RM Tanner","year":"1981","unstructured":"Tanner, R. M. (1981). A recursive approach to low complexity codes. IEEE Transactions on Information Theory, 27(5), 533\u2013547.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"10","key":"5342_CR3","doi-asserted-by":"crossref","first-page":"2977","DOI":"10.1109\/TMAG.2005.854446","volume":"41","author":"L Jin","year":"2005","unstructured":"Jin, L., & Moura, J. M. F. (2005). Partition-and-shift LDPC codes. IEEE Transactions on Magnetics, 41(10), 2977\u20132979.","journal-title":"IEEE Transactions on Magnetics"},{"issue":"2","key":"5342_CR4","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1109\/TVLSI.2008.2002487","volume":"17","author":"S Jin","year":"2009","unstructured":"Jin, S., Zhongfeng, W., Minglun, G., & Li, L. (2009). Multi-Gb\/s LDPC code design and implementation. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 17(2), 262\u2013268.","journal-title":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems"},{"issue":"8","key":"5342_CR5","doi-asserted-by":"crossref","first-page":"2885","DOI":"10.1109\/TIT.2007.901193","volume":"53","author":"K Sunghwan","year":"2007","unstructured":"Sunghwan, K., Jong-Seon, N., Habong, C., & Dong-Joon, S. (2007). Quasi-cyclic low-density parity-check codes with girth larger than 12. IEEE Trans on Information Theory, 53(8), 2885\u20132891.","journal-title":"IEEE Trans on Information Theory"},{"issue":"5","key":"5342_CR6","doi-asserted-by":"crossref","first-page":"1383","DOI":"10.1109\/TCOMM.2010.05.090211","volume":"58","author":"K Jingyu","year":"2010","unstructured":"Jingyu, K., Qin, H., Li, Z., Bo, Z., & Shu, L. (2010). Quasi-cyclic LDPC codes: An algebraic construction. IEEE Transactions on Communications, 58(5), 1383\u20131396.","journal-title":"IEEE Transactions on Communications"},{"issue":"5","key":"5342_CR7","doi-asserted-by":"crossref","first-page":"2648","DOI":"10.1109\/TIT.2011.2179842","volume":"58","author":"H Qin","year":"2012","unstructured":"Qin, H., Qiuju, D., Shu, L., & Abdel-Ghaffar, K. (2012). Cyclic and quasi-cyclic LDPC codes on constrained parity-check matrices and their trapping sets. IEEE Transactions on Information Theory, 58(5), 2648\u20132671.","journal-title":"IEEE Transactions on Information Theory"},{"key":"5342_CR8","doi-asserted-by":"crossref","unstructured":"Xiao-Yu, H., Eleftheriou, E., & Arnold, D. M. (2001). Progressive edge-growth Tanner graphs. In Proc. global telecommunications conference, 2001. GLOBECOM \u201801 (pp. 995\u20131001). IEEE.","DOI":"10.1109\/GLOCOM.2001.965567"},{"key":"5342_CR9","unstructured":"Lu, J., Moura, J. M. F., & Niesen, U. PS-LDPC codes: Regular structure and arbitrary girth, submitted for publication."},{"issue":"8","key":"5342_CR10","doi-asserted-by":"crossref","first-page":"3707","DOI":"10.1109\/TIT.2006.878179","volume":"52","author":"O Milenkovic","year":"2006","unstructured":"Milenkovic, O., Kashyap, N., & Leyba, D. (2006). Shortened array codes of large girth. IEEE Transactions on Information Theory, 52(8), 3707\u20133722.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"9","key":"5342_CR11","doi-asserted-by":"crossref","first-page":"1822","DOI":"10.1109\/LCOMM.2013.070913.130966","volume":"17","author":"Z Guohua","year":"2013","unstructured":"Guohua, Z., Rong, S., & Xinmei, W. (2013). Several explicit constructions for (3, L) QC-LDPC codes with girth at least eight. IEEE Communications Letters, 17(9), 1822\u20131825.","journal-title":"IEEE Communications Letters"},{"key":"5342_CR12","unstructured":"CCSDS131.1-0-2. (2007). Low density parity check codes for use in near earth and deep space applications[S]. CCSDS."}],"container-title":["Wireless Personal Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11277-018-5342-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-018-5342-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-018-5342-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,25]],"date-time":"2020-10-25T23:19:37Z","timestamp":1603667977000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11277-018-5342-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,22]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["5342"],"URL":"https:\/\/doi.org\/10.1007\/s11277-018-5342-0","relation":{},"ISSN":["0929-6212","1572-834X"],"issn-type":[{"type":"print","value":"0929-6212"},{"type":"electronic","value":"1572-834X"}],"subject":[],"published":{"date-parts":[[2018,1,22]]}}}