{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T01:53:54Z","timestamp":1694570034026},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,2,1]],"date-time":"2011-02-01T00:00:00Z","timestamp":1296518400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2011,2]]},"DOI":"10.1007\/s11432-010-4152-0","type":"journal-article","created":{"date-parts":[[2011,2,3]],"date-time":"2011-02-03T21:16:00Z","timestamp":1296767760000},"page":"371-380","source":"Crossref","is-referenced-by-count":3,"title":["Low complexity construction for quasi-cyclic low-density parity-check codes by Progressive-Block Growth"],"prefix":"10.1007","volume":"54","author":[{"given":"PinYi","family":"Ren","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rui","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Cai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,2,4]]},"reference":[{"key":"4152_CR1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","volume-title":"Low-Density Parity-Check Codes","author":"R. G. Gallager","year":"1963","unstructured":"Gallager R G. Low-Density Parity-Check Codes. Cambridge: MIT Press, 1963"},{"key":"4152_CR2","unstructured":"Berrou C, Glavieux A, Thitimajshima P. Near Shannon limit error correcting coding and decoding: Turbo codes. In: Proc IEEE Int Conf Commun, Geneva, Switzerland, 1993. 1064\u20131070"},{"key":"4152_CR3","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1049\/el:19970362","volume":"33","author":"D. J. C. MacKay","year":"1997","unstructured":"MacKay D J C, Neal R M. Near Shannon limit performance of low density parity check codes. Electr Lett, 1997, 33: 457\u2013458","journal-title":"Electr Lett"},{"key":"4152_CR4","doi-asserted-by":"crossref","first-page":"1710","DOI":"10.1109\/18.556667","volume":"42","author":"M. Sipser","year":"1996","unstructured":"Sipser M, Spielman D. Expander codes. IEEE Trans Inf Theory, 1996, 42: 1710\u20131722","journal-title":"IEEE Trans Inf Theory"},{"key":"4152_CR5","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1109\/18.748992","volume":"45","author":"D. J. C. MacKay","year":"1999","unstructured":"MacKay D J C. Good error-correcting codes based on very sparse matrices. IEEE Trans Inf Theory, 1999, 45: 399\u2013431","journal-title":"IEEE Trans Inf Theory"},{"key":"4152_CR6","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1109\/4234.905935","volume":"5","author":"S. Y. Chung","year":"2001","unstructured":"Chung S Y, Forney G D Jr, Richardson T J, et al. On the design of low density parity check codes within 0.0045 dB of the Shannon limit. IEEE Commun Lett, 2001, 5: 58\u201360","journal-title":"IEEE Commun Lett"},{"key":"4152_CR7","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1109\/18.910577","volume":"47","author":"T. J. Richardson","year":"2001","unstructured":"Richardson T J, Urbanke R. The capacity of low density parity check codes under message passing decoding. IEEE Trans Inf Theory, 2001, 47: 599\u2013618","journal-title":"IEEE Trans Inf Theory"},{"key":"4152_CR8","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1109\/TCOMM.2005.861667","volume":"54","author":"Z.W. Li","year":"2006","unstructured":"Li ZW, Chen L, Zeng L Q, et al. Efficient encoding of quasi-cyclic low-density parity-check codes. IEEE Trans Commun, 2006, 54: 71\u201381","journal-title":"IEEE Trans Commun"},{"key":"4152_CR9","doi-asserted-by":"crossref","first-page":"2711","DOI":"10.1109\/18.959255","volume":"47","author":"Y. Kou","year":"2001","unstructured":"Kou Y, Lin S, Fossorier M P C. Low density parity check codes based on finite geometries: A rediscovery and new results. IEEE Trans Inf Theory, 2001, 47: 2711\u20132736","journal-title":"IEEE Trans Inf Theory"},{"key":"4152_CR10","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1109\/TCOMM.2008.050483","volume":"56","author":"L. Lan","year":"2008","unstructured":"Lan L, Tai Y Y, Lin S. New constructions of quasi-cyclic LDPC codes based on special classes of BIDB\u2019s for the AWGN and binary erasure channels. IEEE Trans Commun, 2008, 56: 39\u201348","journal-title":"IEEE Trans Commun"},{"key":"4152_CR11","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1109\/LCOMM.2008.080083","volume":"12","author":"I. B. Djordjevic","year":"2008","unstructured":"Djordjevic I B. Quantum LDPC codes from balanced incomplete block designs. IEEE Commun Lett, 2008, 12: 389\u2013391","journal-title":"IEEE Commun Lett"},{"key":"4152_CR12","doi-asserted-by":"crossref","first-page":"1479","DOI":"10.1109\/TIT.2007.892805","volume":"53","author":"J. H. Chen","year":"2007","unstructured":"Chen J H, Tanner R M, Zhang J T, et al. Construction of irregular LDPC codes by quasi-cyclic extension. IEEE Trans Inf Theory, 2007, 53: 1479\u20131483","journal-title":"IEEE Trans Inf Theory"},{"key":"4152_CR13","doi-asserted-by":"crossref","first-page":"2885","DOI":"10.1109\/TIT.2007.901193","volume":"53","author":"S. Kim","year":"2007","unstructured":"Kim S, No J S. Quasi-cyclic low-density parity-check codes with girth larger than 12. IEEE Trans Inf Theory, 2007, 53: 2885\u20132891","journal-title":"IEEE Trans Inf Theory"},{"key":"4152_CR14","doi-asserted-by":"crossref","first-page":"2583","DOI":"10.1109\/TVT.2007.913180","volume":"57","author":"N. Bonello","year":"2008","unstructured":"Bonello N, Chen S. Construction of regular quasi-cyclic protograph LDPC codes based on Vandermonde. IEEE Trans Vehicular Technol, 2008, 57: 2583\u20132588","journal-title":"IEEE Trans Vehicular Technol"},{"key":"4152_CR15","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1109\/LCOMM.2008.080065","volume":"12","author":"C. M. Huang","year":"2008","unstructured":"Huang C M, Huang J F, Yang C C. Construction of quasi-cyclic LDPC codes from quadratic congruences. IEEE Commun Lett, 2008, 12: 313\u2013315","journal-title":"IEEE Commun Lett"},{"key":"4152_CR16","doi-asserted-by":"crossref","first-page":"1788","DOI":"10.1109\/TIT.2004.831841","volume":"50","author":"M. P. C. Fossorier","year":"2004","unstructured":"Fossorier M P C. Quasi-cyclic low-density parity-check codes from circulant permutation matrices. IEEE Trans Inf Theory, 2004, 50: 1788\u20131793","journal-title":"IEEE Trans Inf Theory"},{"key":"4152_CR17","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1109\/TIT.1981.1056404","volume":"27","author":"R. M. Tanner","year":"1981","unstructured":"Tanner R M. A recursive approach to low complexity codes. IEEE Trans Inf Theory, 1981, 27: 533\u2013547","journal-title":"IEEE Trans Inf Theory"},{"key":"4152_CR18","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1109\/TIT.2004.839541","volume":"51","author":"X. Y. Hu","year":"2005","unstructured":"Hu X Y, Elefherio E, Arnold D M. Regular and irregular progressive edge-growth Tanner graphs. IEEE Trans Inf Theory, 2005, 51: 386\u2013398","journal-title":"IEEE Trans Inf Theory"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-010-4152-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-010-4152-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-010-4152-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T09:42:21Z","timestamp":1559986941000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-010-4152-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,2]]}},"alternative-id":["4152"],"URL":"https:\/\/doi.org\/10.1007\/s11432-010-4152-0","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,2]]}}}