{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T05:41:13Z","timestamp":1725946873887},"publisher-location":"Singapore","reference-count":24,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811078767"},{"type":"electronic","value":"9789811078774"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-981-10-7877-4_27","type":"book-chapter","created":{"date-parts":[[2018,2,2]],"date-time":"2018-02-02T01:53:19Z","timestamp":1517536399000},"page":"299-306","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Quasi-Cyclic LDPC Codes Constructed Based on Row-Column Constrained Matrices"],"prefix":"10.1007","author":[{"given":"Hengzhou","family":"Xu","sequence":"first","affiliation":[]},{"given":"Baoming","family":"Bai","sequence":"additional","affiliation":[]},{"given":"Hai","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Mengmeng","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Bo","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,2,3]]},"reference":[{"issue":"1","key":"27_CR1","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/TIT.1962.1057683","volume":"8","author":"RG Gallager","year":"1962","unstructured":"Gallager, R.G.: Low-density parity-check codes. IRE Trans. Inf. Theory 8(1), 21\u201328 (1962)","journal-title":"IRE Trans. Inf. Theory"},{"issue":"6","key":"27_CR2","doi-asserted-by":"crossref","first-page":"2947","DOI":"10.1109\/TIT.2015.2508455","volume":"62","author":"Q Diao","year":"2016","unstructured":"Diao, Q., Li, J., Lin, S., Blake, I.F.: New classes of partial geometries and their associated LDPC codes. IEEE Trans. Inf. Theory 62(6), 2947\u20132965 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"27_CR3","unstructured":"CCSDS 231.1-O-1. Short Block Length LDPC Codes for TC Synchronization and Channel Coding. Washington DC (2015)"},{"issue":"8","key":"27_CR4","doi-asserted-by":"crossref","first-page":"1788","DOI":"10.1109\/TIT.2004.831841","volume":"50","author":"MPC Fossorier","year":"2004","unstructured":"Fossorier, M.P.C.: Quasi-cyclic low-density parity-check codes from circulant permutation matrices. IEEE Trans. Inf. Theory 50(8), 1788\u20131794 (2004)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"27_CR5","doi-asserted-by":"crossref","first-page":"2039","DOI":"10.1109\/TIT.2017.2655029","volume":"63","author":"H Khodaiemehr","year":"2017","unstructured":"Khodaiemehr, H., Kiani, D.: Construction and encoding of QC-LDPC codes using group rings. IEEE Trans. Inf. Theory 63(4), 2039\u20132060 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"27_CR6","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1109\/TCOMM.2005.861667","volume":"54","author":"Z Li","year":"2006","unstructured":"Li, Z., Chen, Z.L., Lin, S., Fong, W.H.: Efficient encoding of quasi-cyclic low-density parity-check codes. IEEE Trans. Commun. 54(1), 71\u201381 (2006)","journal-title":"IEEE Trans. Commun."},{"issue":"5","key":"27_CR7","doi-asserted-by":"crossref","first-page":"2648","DOI":"10.1109\/TIT.2011.2179842","volume":"58","author":"Q Huang","year":"2012","unstructured":"Huang, Q., Diao, Q., Lin, S., Abdel-Ghaffar, K.: Cyclic and quasi-cyclic LDPC codes on constrained parity-check matrices and their trapping sets. IEEE Trans. Inf. Theory 58(5), 2648\u20132671 (2012)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Zhang, L., Lin, S., Abdel-Ghaffar, K., Zhou, B.: Circulant arrays: Rank analysis and construction of quasi-cyclic LDPC codes. In: IEEE International Symposium on Information Theory 2010, pp. 814\u2013818 (2010)","DOI":"10.1109\/ISIT.2010.5513640"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Li, J., Liu, K., Lin, S., Abdel-Ghaffar, K.: Quasi-cyclic LDPC codes on two arbitrary sets of a finite field. In: IEEE International Symposium on Information Theory 2014, pp. 2454\u20132458 (2014)","DOI":"10.1109\/ISIT.2014.6875275"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Li, J., Liu, K., Lin, S., Abdel-Ghaffar, K., Ryan, W.: An unnoticed strong connection between algebraic-based and protograph-based LDPC codes, Part I: binary case and interpretation. In: Information Theory and Applications Workshop (ITA) 2015, pp. 36\u201345 (2015)","DOI":"10.1109\/ITA.2015.7308964"},{"issue":"10","key":"27_CR11","doi-asserted-by":"crossref","first-page":"5856","DOI":"10.1109\/TIT.2014.2342735","volume":"60","author":"DGM Mitchell","year":"2014","unstructured":"Mitchell, D.G.M., Smarandache, R., Costello, D.J.: Quasi-cyclic LDPC codes based on pre-lifted protographs. IEEE Trans. Inf. Theory 60(10), 5856\u20135874 (2014)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"27_CR12","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., Lin, S., Memari, B., Honary, B.: New constructions of quasi-cyclic LDPC codes based on special classes of BIBD\u2019s for the AWGN and binary erasure channels channels. IEEE Trans. Commun. 56(1), 39\u201348 (2008)","journal-title":"IEEE Trans. Commun."},{"key":"27_CR13","first-page":"111","volume":"2015","author":"H Xu","year":"2015","unstructured":"Xu, H., Feng, D., Sun, C., Bai, B.: Construction of LDPC codes based on resolvable group divisible designs. IEEE International Workshop on High Mobility Wireless Communications 2015, 111\u2013115 (2015)","journal-title":"IEEE International Workshop on High Mobility Wireless Communications"},{"issue":"12","key":"27_CR14","doi-asserted-by":"crossref","first-page":"7898","DOI":"10.1109\/TIT.2013.2280640","volume":"59","author":"Q Diao","year":"2013","unstructured":"Diao, Q., Tai, Y., Lin, S., Abdel-Ghaffar, K.: LDPC codes on partial geometries: Construction, trapping set structure, and puncturing. IEEE Trans. Inf. Theory 59(12), 7898\u20137914 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"27_CR15","unstructured":"Song, S., Zhou, B., Lin, S., Abdel-Ghaffar, K.: A unified approach to the construction of binary and nonbinary quasi-cyclic LDPC codes based on finite fields. IEEE Trans. Commun. 57(1), 84\u201393 (2009)"},{"issue":"1","key":"27_CR16","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1109\/TIT.2015.2496213","volume":"62","author":"I Bocharova","year":"2016","unstructured":"Bocharova, I., Kudryashov, B., Johannesson, R.: Searching for binary and nonbinary block and convolutional LDPC codes. IEEE Trans. Inf. Theory 62(1), 163\u2013183 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"27_CR17","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1109\/18.748992","volume":"45","author":"DJC Mackay","year":"1999","unstructured":"Mackay, D.J.C.: Good error-correcting codes based on very sparse matrices. IEEE Trans. Inf. Theory 45(2), 399\u2013431 (1999)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"27_CR18","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1109\/TIT.1981.1056404","volume":"27","author":"RM Tanner","year":"1981","unstructured":"Tanner, R.M.: A recursive approach to low complexity codes. IEEE Trans. Inf. Theory 27(5), 533\u2013547 (1981)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"27_CR19","doi-asserted-by":"crossref","first-page":"2370","DOI":"10.1109\/LCOMM.2016.2608938","volume":"20","author":"H Xu","year":"2016","unstructured":"Xu, H., Feng, D., Luo, R., Bai, B.: Construction of quasi-cyclic LDPC codes via masking with successive cycle elimination. IEEE Commun. Lett. 20(12), 2370\u20132373 (2016)","journal-title":"IEEE Commun. Lett."},{"issue":"4","key":"27_CR20","doi-asserted-by":"crossref","first-page":"1552","DOI":"10.1109\/TIT.2016.2523979","volume":"62","author":"A Tasdighi","year":"2016","unstructured":"Tasdighi, A., Banihashemi, A.H., Sadeghi, M.: Efficient search of girth-optimal QC-LDPC codes. IEEE Trans. Inf. Theory 62(4), 1552\u20131564 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"27_CR21","doi-asserted-by":"crossref","unstructured":"Liu, Y., Li, Y.: Design of masking matrix for QC-LDPC codes. In: IEEE Information Theory Workshop (ITW) 2013, pp. 1\u20135 (2013)","DOI":"10.1109\/ITW.2013.6691248"},{"key":"27_CR22","doi-asserted-by":"crossref","unstructured":"Ryan, W.E., Lin, S.: Channel codes: Classical and Modern, pp. 452\u2013453. Cambridge University Press, USA (2009)","DOI":"10.1017\/CBO9780511803253"},{"issue":"1","key":"27_CR23","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1109\/TIT.2004.839541","volume":"51","author":"Y Hu","year":"2005","unstructured":"Hu, Y., Eleftheriou, E., Arnold, D.M.: Regular and irregular progressive edge growth Tanner graphs. IEEE Trans. Inf. Theory 51(1), 386\u2013398 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"27_CR24","doi-asserted-by":"crossref","first-page":"3597","DOI":"10.1109\/TCOMM.2009.12.080493","volume":"57","author":"Q Huang","year":"2016","unstructured":"Huang, Q., Kang, J., Zhang, L., Lin, S., Abdel-Ghaffar, K.: Two reliability-based iterative majority-logic decoding algorithms for LDPC codes. IEEE Trans. Commun. 57(12), 3597\u20133606 (2009)","journal-title":"IEEE Trans. Commun."}],"container-title":["Communications in Computer and Information Science","Space Information Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-10-7877-4_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,10]],"date-time":"2019-10-10T01:12:35Z","timestamp":1570669955000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-10-7877-4_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9789811078767","9789811078774"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-981-10-7877-4_27","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2018]]}}}