{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T04:43:20Z","timestamp":1648961000822},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2009,5,1]],"date-time":"2009-05-01T00:00:00Z","timestamp":1241136000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sci. China Ser. F-Inf. Sci."],"published-print":{"date-parts":[[2009,5]]},"DOI":"10.1007\/s11432-009-0103-z","type":"journal-article","created":{"date-parts":[[2009,5,14]],"date-time":"2009-05-14T07:49:03Z","timestamp":1242287343000},"page":"894-898","source":"Crossref","is-referenced-by-count":0,"title":["Multiple accumulated-crossover parallel concatenated SPC codes"],"prefix":"10.1007","volume":"52","author":[{"given":"Kai","family":"Guo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"YanHui","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JianDong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,5,15]]},"reference":[{"key":"103_CR1","doi-asserted-by":"crossref","first-page":"1064","DOI":"10.1109\/ICC.1993.397441","volume-title":"Proceedings of IEEE International Conference on Communications (ICC\u201993)","author":"C. Berrou","year":"1993","unstructured":"Berrou C, Glavieux A, Thitimajshima P. Near Shannon limit error-correcting coding and decoding: Turbo codes. In: Proceedings of IEEE International Conference on Communications (ICC\u201993). Geneve: IEEE Communication Society, 1993. 1064\u20131070"},{"issue":"1","key":"103_CR2","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/TIT.1962.1057683","volume":"8","author":"R. G. Gallager","year":"1962","unstructured":"Gallager R G. Low-density parity-check codes. IRE Trans Inf Theory, 1962, 8(1): 21\u201328","journal-title":"IRE Trans Inf Theory"},{"issue":"3","key":"103_CR3","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(3): 399\u2013431","journal-title":"IEEE Trans Inf Theory"},{"issue":"1","key":"103_CR4","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s11432-007-0003-z","volume":"50","author":"L. H. Ma","year":"2007","unstructured":"Ma L H, Chang Y L, Wang S D. Study on the distribution law of random code structure of irregular LDPC codes and its application in eliminating short cycles. Sci China Ser F-Inf Sci, 2007, 50(1): 99\u2013104","journal-title":"Sci China Ser F-Inf Sci"},{"key":"103_CR5","first-page":"1","volume-title":"Proceedings of 2nd International Symposium on Turbo Codes Related Topics","author":"H. Jin","year":"2000","unstructured":"Jin H, Khandekar A, Mceliece R. Irregular repeat-accumulate codes. In: Proceedings of 2nd International Symposium on Turbo Codes Related Topics. Brest, France, 2000. 1\u20138"},{"issue":"7","key":"103_CR6","doi-asserted-by":"crossref","first-page":"1038","DOI":"10.1109\/TCOMM.2004.831353","volume":"52","author":"L. Chen","year":"2004","unstructured":"Chen L, Xu J, Djurdjevic I, et al. Near-Shannon-limit quasi-cyclic low-density parity-check codes. IEEE Trans Commun, 2004, 52(7): 1038\u20131042","journal-title":"IEEE Trans Commun"},{"issue":"10","key":"103_CR7","doi-asserted-by":"crossref","first-page":"1666","DOI":"10.1109\/TCOMM.2003.818085","volume":"51","author":"J. S. K. Tee","year":"2003","unstructured":"Tee J S K, Taylor D P, Martin P A. Multiple serial and parallel concatenated single parity-check codes. IEEE Trans Commun, 2003, 51(10): 1666\u20131675","journal-title":"IEEE Trans Commun"},{"issue":"8","key":"103_CR8","doi-asserted-by":"crossref","first-page":"2753","DOI":"10.1109\/TWC.2007.05283","volume":"6","author":"M. Gonzalez-Lopez","year":"2007","unstructured":"Gonzalez-Lopez M, Vazquez-Araujo F J, Castedo L, et al. Serially-concatenated low-density generator matrix (SCLDGM) codes for transmission over AWGN and rayleigh fading channels. IEEE Trans Wireless Commun, 2007, 6(8): 2753\u20132758","journal-title":"IEEE Trans Wireless Commun"},{"issue":"2","key":"103_CR9","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1109\/18.910589","volume":"47","author":"P. Li","year":"2001","unstructured":"Li P, Wu K Y. Concatenated tree codes: a low complexity, high-performance approach. IEEE Trans Inf Theory, 2001, 47(2): 791\u2013799","journal-title":"IEEE Trans Inf Theory"},{"issue":"2","key":"103_CR10","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1109\/49.661110","volume":"16","author":"F. R. Kschischang","year":"1998","unstructured":"Kschischang F R, Frey B J. Iterative decoding of compound codes by probability propagation in graphical models. IEEE J Select Areas Commun, 1998, 16(2): 219\u2013230","journal-title":"IEEE J Select Areas Commun"},{"issue":"1","key":"103_CR11","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, Eleftheriou E, Arnold D M. Regular and irregular progressive edge growth Tanner graphs. IEEE Trans Inf Theory, 2005, 51(1): 386\u2013398","journal-title":"IEEE Trans Inf Theory"},{"issue":"1","key":"103_CR12","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1109\/TIT.2003.821995","volume":"50","author":"J. Li","year":"2004","unstructured":"Li J, Narayanan K R, Georghiades C N. Product accumulate codes: a class of codes with near-capacity performance and low decoding complexity. IEEE Trans Inf Theory, 2004, 50(1): 31\u201346","journal-title":"IEEE Trans Inf Theory"}],"container-title":["Science in China Series F: Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-009-0103-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-009-0103-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-009-0103-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T11:35:59Z","timestamp":1559388959000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-009-0103-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5]]},"references-count":12,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2009,5]]}},"alternative-id":["103"],"URL":"https:\/\/doi.org\/10.1007\/s11432-009-0103-z","relation":{},"ISSN":["1009-2757","1862-2836"],"issn-type":[{"value":"1009-2757","type":"print"},{"value":"1862-2836","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,5]]}}}