{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T07:52:22Z","timestamp":1723017142536},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,2,1]],"date-time":"2014-02-01T00:00:00Z","timestamp":1391212800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2014,2]]},"DOI":"10.1007\/s11432-013-4948-9","type":"journal-article","created":{"date-parts":[[2014,2,24]],"date-time":"2014-02-24T11:17:29Z","timestamp":1393240649000},"page":"1-11","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Design of efficiently encodable nonbinary LDPC codes for adaptive coded modulation"],"prefix":"10.1007","volume":"57","author":[{"given":"XiuNi","family":"Wang","sequence":"first","affiliation":[]},{"given":"Xiao","family":"Ma","sequence":"additional","affiliation":[]},{"given":"BaoMing","family":"Bai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,5,28]]},"reference":[{"key":"4948_CR1","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 Inform Theory, 1962, 8: 21\u201328","journal-title":"IRE Trans Inform Theory"},{"key":"4948_CR2","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. Electron Lett, 1997, 33: 457\u2013458","journal-title":"Electron Lett"},{"key":"4948_CR3","doi-asserted-by":"crossref","first-page":"1723","DOI":"10.1109\/18.556668","volume":"42","author":"D A Spielman","year":"1996","unstructured":"Spielman D A. Linear-time encodable and decodable error-correcting codes. IEEE Trans Inform Theory, 1996, 42: 1723\u20131731","journal-title":"IEEE Trans Inform Theory"},{"key":"4948_CR4","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1109\/4234.681360","volume":"2","author":"M C Davey","year":"1998","unstructured":"Davey M C, MacKay D J C. Low density parity check codes over GF(q). IEEE Commun Lett, 1998, 2: 165\u2013167","journal-title":"IEEE Commun Lett"},{"key":"4948_CR5","first-page":"113","volume-title":"International Conference on Mathematic and its Applications: Codes, Systems and Graphincal Models, New York","author":"D J C MacKay","year":"2000","unstructured":"MacKay D J C, Davey M C. Evaluation of gallager codes for short block length and high rate application. In: International Conference on Mathematic and its Applications: Codes, Systems and Graphincal Models, New York, 2000. 113\u2013130"},{"key":"4948_CR6","first-page":"70","volume-title":"IEEE Information Theory Workshop, Paris France","author":"L Barnault","year":"2003","unstructured":"Barnault L, Declercq D. Fast decoding algorithm for nonbinary LDPC codes over GF(q). In: IEEE Information Theory Workshop, Paris France, 2003. 70\u201373"},{"key":"4948_CR7","first-page":"1193","volume-title":"IEEE Global Telecommunications Conference, St. Louis","author":"L Q Zeng","year":"2005","unstructured":"Zeng L Q, Lan L, Tai Y Y, et al. Dispersed Reed-Solomon codes for iterative decoding and construction of q-ary LDPC codes. In: IEEE Global Telecommunications Conference, St. Louis, 2005. 1193\u20131198"},{"key":"4948_CR8","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1109\/TCOMM.2008.060024","volume":"56","author":"L Q Zeng","year":"2008","unstructured":"Zeng L Q, Lan L, Tai Y Y, et al. Constructions of nonbinary quasi-cyclic LDPC codes: a finite field approach. IEEE Trans Commun, 2008, 56: 545\u2013554","journal-title":"IEEE Trans Commun"},{"key":"4948_CR9","first-page":"671","volume-title":"IEEE International Conference on Communications, Glasgow","author":"A Voicila","year":"2007","unstructured":"Voicila A, Declercq D, Verdier F, et al. Low-complexity, low-memory EMS algorithm for nonbinary LDPC codes. In: IEEE International Conference on Communications, Glasgow, 2007. 671\u2013676"},{"key":"4948_CR10","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1109\/TCOMM.2011.092011.110082","volume":"60","author":"X Ma","year":"2012","unstructured":"Ma X, Zhang K, Chen H Q, et al. Low complexity X-EMS algorithms for nonbinary LDPC codes. IEEE Trans Commun, 2012, 60: 9\u201313","journal-title":"IEEE Trans Commun"},{"key":"4948_CR11","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511841224","volume-title":"Wireless Communications","author":"A Goldsmith","year":"2005","unstructured":"Goldsmith A. Wireless Communications. Cambridge: Cambridge University Press, 2005"},{"key":"4948_CR12","doi-asserted-by":"crossref","first-page":"2269","DOI":"10.1109\/JPROC.2007.904444","volume":"95","author":"G Caire","year":"2007","unstructured":"Caire G, Kumar K R. Information theoretic foundations of adaptive coded modulation. Proc IEEE, 2007, 95: 2269\u20132273","journal-title":"Proc IEEE"},{"key":"4948_CR13","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 discovery and new results. IEEE Trans Inform Theory, 2001, 47: 2711\u20132736","journal-title":"IEEE Trans Inform Theory"},{"key":"4948_CR14","doi-asserted-by":"crossref","first-page":"2966","DOI":"10.1109\/TIT.2004.838370","volume":"50","author":"R M Tanner","year":"2004","unstructured":"Tanner R M, Sridhara D, Sridharan A, et al. LDPC block and convolutional codes based on circulant matrices. IEEE Trans Inform Theory, 2004, 50: 2966\u20132984","journal-title":"IEEE Trans Inform Theory"},{"key":"4948_CR15","doi-asserted-by":"crossref","first-page":"2429","DOI":"10.1109\/TIT.2007.899516","volume":"53","author":"L Lan","year":"2007","unstructured":"Lan L, Zeng L Q, Tai Y Y, et al. Construction of quasi-cyclic LDPC codes for AWGN and binary erasure channels: a finite field approach. IEEE Trans Inform Theory, 2007, 53: 2429\u20132458","journal-title":"IEEE Trans Inform Theory"},{"key":"4948_CR16","doi-asserted-by":"crossref","first-page":"1788","DOI":"10.1109\/TIT.2004.831841","volume":"50","author":"M Fossorier","year":"2004","unstructured":"Fossorier M. Quasi-cyclic low-density parity-check codes from ciuculant permutation matrices. IEEE Trans Inform Theory, 2004, 50: 1788\u20131793","journal-title":"IEEE Trans Inform Theory"},{"key":"4948_CR17","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1109\/TCOMM.2007.894088","volume":"55","author":"D Declercq","year":"2007","unstructured":"Declercq D, Fossorier M. Decoding algorithms for nonbinary LDPC codes over GF(q). IEEE Trans Commun, 2007, 55: 633\u2013643","journal-title":"IEEE Trans Commun"},{"key":"4948_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TCOMM.2012.101712.110173","volume":"60","author":"S C Zhao","year":"2013","unstructured":"Zhao S C, Ma X, Zhang X Y, et al. A class of nonbinary LDPC codes with fast encoding and decoding algorithms. IEEE Trans Commun, 2013, 60: 1\u20136","journal-title":"IEEE Trans Commun"},{"key":"4948_CR19","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TCOMM.2007.894089","volume":"55","author":"A Goupil","year":"2007","unstructured":"Goupil A, Colas M, Gelle G, et al. FFT-based BP decoding of general LDPC codes over Abelian groups. IEEE Trans Commun, 2007, 55: 644\u2013649","journal-title":"IEEE Trans Commun"},{"key":"4948_CR20","doi-asserted-by":"crossref","first-page":"2734","DOI":"10.1109\/TCOMM.2009.09.080067","volume":"57","author":"H L Zhu","year":"2009","unstructured":"Zhu H L, Wang J Z. Chunk-based resource allocation in OFDMA systems\u2014Part I: chunk allocation. IEEE Trans Commun, 2009, 57: 2734\u20132744","journal-title":"IEEE Trans Commun"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-013-4948-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-013-4948-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-013-4948-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T15:37:53Z","timestamp":1559403473000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-013-4948-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["4948"],"URL":"https:\/\/doi.org\/10.1007\/s11432-013-4948-9","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2]]}}}