{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T15:58:32Z","timestamp":1769356712970,"version":"3.49.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,6,29]],"date-time":"2016-06-29T00:00:00Z","timestamp":1467158400000},"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":["Wireless Pers Commun"],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.1007\/s11277-016-3465-8","type":"journal-article","created":{"date-parts":[[2016,6,29]],"date-time":"2016-06-29T22:20:29Z","timestamp":1467238829000},"page":"369-381","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A New Construction Method for Large Girth Quasi-Cyclic LDPC Codes with Optimized Lower Bound using Chinese Remainder Theorem"],"prefix":"10.1007","volume":"91","author":[{"given":"Ambar","family":"Bajpai","sequence":"first","affiliation":[]},{"given":"Gan","family":"Srirutchataboon","sequence":"additional","affiliation":[]},{"given":"Piya","family":"Kovintavewat","sequence":"additional","affiliation":[]},{"given":"Lunchakorn","family":"Wuttisittikulkij","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,29]]},"reference":[{"issue":"1","key":"3465_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. (1962). Low-density parity-check codes. IRE Transactions on Information Theory, 8(1), 21\u201328.","journal-title":"IRE Transactions on Information Theory"},{"issue":"5","key":"3465_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":"6","key":"3465_CR3","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1049\/el:19970362","volume":"33","author":"DJC MacKay","year":"1997","unstructured":"MacKay, D. J. C., & Neal, R. M. (1997). Near Shannon limit performance of low density parity check codes. Electronics Letters, 33(6), 457\u2013458.","journal-title":"Electronics Letters"},{"key":"3465_CR4","doi-asserted-by":"crossref","unstructured":"Davey, M. C., & MacKay, D. J. (1998). Low density parity check codes over GF (q). In Proceedings of IEEE information theory workshop. (pp. 70\u201371). USA, June 1998.","DOI":"10.1109\/ITW.1998.706440"},{"issue":"2","key":"3465_CR5","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1109\/18.748992","volume":"45","author":"DJ MacKay","year":"1999","unstructured":"MacKay, D. J. (1999). Good error-correcting codes based on very sparse matrices. IEEE Transactions on Information Theory, 45(2), 399\u2013431.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"8","key":"3465_CR6","doi-asserted-by":"crossref","first-page":"1788","DOI":"10.1109\/TIT.2004.831841","volume":"50","author":"MP Fossorier","year":"2004","unstructured":"Fossorier, M. P. (2004). Quasicyclic low-density parity-check codes from circulant permutation matrices. IEEE Transactions on Information Theory, 50(8), 1788\u20131793.","journal-title":"IEEE Transactions on Information Theory"},{"key":"3465_CR7","unstructured":"Li, Z., & Kumar, B. V. (2004). A class of good quasi-cyclic low-density parity check codes based on progressive edge growth graph. In Proceedings of 38th Asilomar Conference on Signals, Systems and Computers, (Vol. 2, pp. 1190\u20131994). Pacific Grove, CA, USA, November 2004."},{"issue":"8","key":"3465_CR8","doi-asserted-by":"crossref","first-page":"1248","DOI":"10.1109\/TCOMM.2004.833037","volume":"52","author":"B Vasic","year":"2004","unstructured":"Vasic, B., Pedagani, K., & Ivkovic, M. (2004). High-rate girth-eight low-density parity-check codes on rectangular integer lattices. IEEE Transactions on Communications, 52(8), 1248\u20131252.","journal-title":"IEEE Transactions on Communications"},{"key":"3465_CR9","unstructured":"Lin, S., & Costello, D. J. (2004). Error control coding: fundamentals and applications, chapter 17, vol. 114, Englewood Cliffs: Pearson Prentice Hall."},{"issue":"4","key":"3465_CR10","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1109\/LCOMM.2014.030114.132853","volume":"18","author":"J Zhang","year":"2014","unstructured":"Zhang, J., & Zhang, G. (2014). Deterministic girth-eight QC-LDPC codes with large column weight. IEEE Communications Letters, 18(4), 656\u2013659.","journal-title":"IEEE Communications Letters"},{"key":"3465_CR11","doi-asserted-by":"crossref","unstructured":"Fan, J. L. (2001). Array codes as LDPC codes. In Constrained Coding and Soft Iterative Decoding, (pp. 195\u2013203). Springer USA.","DOI":"10.1007\/978-1-4615-1525-8_7"},{"issue":"8","key":"3465_CR12","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"},{"key":"3465_CR13","doi-asserted-by":"crossref","unstructured":"Eleftheriou, E., & Olcer, S. (2002). Low-density parity-check codes for digital subscriber lines. In Proceedings of IEEE international conference on communications, (Vol. 3, pp. 1752\u20131757). New York, USA, 2002.","DOI":"10.1109\/ICC.2002.997149"},{"key":"3465_CR14","unstructured":"Singhaudom, W., Noppankeepong, S., & Suphithi, P. (2007). May. Design of high-rate modified array codes for magnetic recording system. In Proceedings of 4th international conference on electrical engineering\/electronics, computer, telecommunications and information technology, (pp. 553\u2013556). ECTI, Chiangrai, Thailand, 2007."},{"issue":"11\u201312","key":"3465_CR15","first-page":"501","volume":"68","author":"M Saadi","year":"2014","unstructured":"Saadi, M., Bajpai, A., Zhao, Y., Sangwongngam, P., & Wuttisittikulkij, L. (2014). Design and Implementation of Secure and Reliable communication using optical wireless communication. Frequenz, 68(11\u201312), 501\u2013509.","journal-title":"Frequenz"},{"issue":"16","key":"3465_CR16","doi-asserted-by":"crossref","first-page":"1257","DOI":"10.1049\/el.2015.0389","volume":"51","author":"Y Zhang","year":"2015","unstructured":"Zhang, Y., & Da, X. (2015). Construction of girth-eight QC-LDPC codes from arithmetic progression sequence with large column weight. Electronics Letters, 51(16), 1257\u20131259.","journal-title":"Electronics Letters"},{"key":"3465_CR17","doi-asserted-by":"publisher","unstructured":"Ranganathan, S. V., Divsalar, D., & Wesel, R. D. (2015). On the Girth of (3, L) Quasi-cyclic LDPC codes based on complete protographs. doi: 10.1109\/ISIT.2015.7282491 .","DOI":"10.1109\/ISIT.2015.7282491"},{"issue":"9","key":"3465_CR18","doi-asserted-by":"crossref","first-page":"823","DOI":"10.1109\/LCOMM.2005.1506715","volume":"9","author":"S Myung","year":"2005","unstructured":"Myung, S., & Yang, K. (2005). A combining method of quasi-cyclic LDPC codes by the Chinese remainder theorem. IEEE Communications Letters, 9(9), 823\u2013825.","journal-title":"IEEE Communications Letters"},{"issue":"5","key":"3465_CR19","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1109\/LCOMM.2009.082115","volume":"13","author":"X Jiang","year":"2009","unstructured":"Jiang, X., & Lee, M. H. (2009). Large girth quasi-cyclic LDPC codes based on the Chinese remainder theorem. IEEE Communications Letters, 13(5), 342\u2013344.","journal-title":"IEEE Communications Letters"},{"issue":"7","key":"3465_CR20","doi-asserted-by":"crossref","first-page":"4542","DOI":"10.1109\/TIT.2013.2251395","volume":"59","author":"M Karimi","year":"2013","unstructured":"Karimi, M., & Banihashemi, A. H. (2013). On the girth of quasi-cyclic protograph LDPC codes. IEEE Transactions on Information Theory, 59(7), 4542\u20134552.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"11","key":"3465_CR21","doi-asserted-by":"crossref","first-page":"7288","DOI":"10.1109\/TIT.2013.2279831","volume":"59","author":"KJ Kim","year":"2013","unstructured":"Kim, K. J., Chung, J. H., & Yang, K. (2013). Bounds on the size of parity-check matrices for quasi-cyclic low-density parity-check codes. IEEE Transactions on Information Theory, 59(11), 7288\u20137298.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"3465_CR22","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1109\/TIT.2004.839541","volume":"51","author":"XY Hu","year":"2005","unstructured":"Hu, X. Y., Eleftheriou, E., & Arnold, D. M. (2005). Regular and irregular progressive edge-growth tanner graphs. IEEE Transactions on Information Theory, 51(1), 386\u2013398.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"22","key":"3465_CR23","doi-asserted-by":"crossref","first-page":"6096","DOI":"10.1109\/TSP.2015.2463258","volume":"63","author":"A Mahdi","year":"2015","unstructured":"Mahdi, A., & Paliouras, V. (2015). On the encoding complexity of quasi-cyclic LDPC codes. IEEE Transactions on Signal Processing, 63(22), 6096\u20136108.","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"5","key":"3465_CR24","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1109\/LCOMM.2008.080132","volume":"12","author":"Y Liu","year":"2008","unstructured":"Liu, Y., Wang, X., Chen, R., & He, Y. (2008). Generalized combining method for design of quasi-cyclic LDPC codes. IEEE Communications Letters, 12(5), 392\u2013394.","journal-title":"IEEE Communications Letters"},{"issue":"1","key":"3465_CR25","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1109\/TVLSI.2008.2007736","volume":"18","author":"D Oh","year":"2010","unstructured":"Oh, D., & Parhi, K. K. (2010). Low-complexity switch network for reconfigurable LDPC decoders. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 18(1), 85\u201394.","journal-title":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems"}],"container-title":["Wireless Personal Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-016-3465-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11277-016-3465-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-016-3465-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T17:29:14Z","timestamp":1498325354000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11277-016-3465-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,29]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,11]]}},"alternative-id":["3465"],"URL":"https:\/\/doi.org\/10.1007\/s11277-016-3465-8","relation":{},"ISSN":["0929-6212","1572-834X"],"issn-type":[{"value":"0929-6212","type":"print"},{"value":"1572-834X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,29]]}}}