{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,22]],"date-time":"2024-02-22T18:50:27Z","timestamp":1708627827217},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,1,17]],"date-time":"2019-01-17T00:00:00Z","timestamp":1547683200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Wireless Com Network"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1186\/s13638-018-1325-9","type":"journal-article","created":{"date-parts":[[2019,1,17]],"date-time":"2019-01-17T09:04:17Z","timestamp":1547715857000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A construction of the high-rate regular quasi-cyclic LDPC codes"],"prefix":"10.1186","volume":"2019","author":[{"given":"Qi","family":"Meng","sequence":"first","affiliation":[]},{"given":"Jia Xiang","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Liang","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,17]]},"reference":[{"issue":"1","key":"1325_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1962.1057683","volume":"8","author":"R. Gallager","year":"1962","unstructured":"R. Gallager, Low-density parity-check codes. IRE Trans. Inform. Theory.8(1), 21\u201328 (1962).","journal-title":"IRE Trans. Inform. Theory."},{"issue":"1","key":"1325_CR2","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1186\/s13638-017-0885-4","volume":"2017","author":"N. Balasuriya","year":"2017","unstructured":"N. Balasuriya, C. B. Wavegedara, Improved symbol value selection for symbol flipping-based non-binary LDPC decoding. EURASIP J. Wirel. Commun. Netw.2017(1), 105 (2017).","journal-title":"EURASIP J. Wirel. Commun. Netw."},{"issue":"1","key":"1325_CR3","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1186\/s13638-016-0761-7","volume":"2016","author":"K. Kwon","year":"2016","unstructured":"K. Kwon, T. Kim, J. Heo, Pre-coded LDPC coding for physical layer security. EURASIP J. Wirel. Commun. Netw.2016(1), 283 (2016).","journal-title":"EURASIP J. Wirel. Commun. Netw."},{"issue":"1","key":"1325_CR4","first-page":"14","volume":"65","author":"A. Tasdighi","year":"2017","unstructured":"A. Tasdighi, A. H. Banihashemi, author=Sadeghi, M.R., Symmetrical constructions for regular girth-8 QC-LDPC codes. IEEE Trans. Commun.65(1), 14\u201322 (2017).","journal-title":"IEEE Trans. Commun."},{"key":"1325_CR5","unstructured":"S. K. Chronopoulos, G. Tatsis, V. Raptis, P. Kostarakis, in Proceedings of the 2nd Pan-Hellenic Conference on Electronics and Telecommunications. A parallel turbo encoder-decoder scheme (Thessaloniki, 2012)."},{"issue":"4","key":"1325_CR6","doi-asserted-by":"publisher","first-page":"229","DOI":"10.4236\/cn.2011.34027","volume":"3","author":"S. K. Chronopoulos","year":"2011","unstructured":"S. K. Chronopoulos, G. Tatsis, P. Kostarakis, Turbo codes\u2014a new PCCC design. Commun. Netw.3(4), 229\u2013234 (2011).","journal-title":"Commun. Netw."},{"issue":"3","key":"1325_CR7","first-page":"47","volume":"7","author":"B. Bangerter","year":"2003","unstructured":"B. Bangerter, E. Jacobsen, Ho. Minnie, et al, High-throughput wireless LAN air interface. Intel Technol. J.7(3), 47\u201357 (2003).","journal-title":"Intel Technol. J."},{"key":"1325_CR8","doi-asserted-by":"publisher","unstructured":"IEEE Standard for Local and Metropolitan Area Networks Part 16: Air Interface for Fixed and Mobile Broadband Wireless Access Systems Amendment 2: Physical and Medium Access Control Layers for Combined Fixed and Mobile Operation in Licensed Bands and Corrigendum 1,\" in IEEE Std 802.16e-2005 and IEEE Std 802.16-2004\/Cor 1-2005 (Amendment and Corrigendum to IEEE Std 802.16-2004), vol., no., pp.0_1-822, 2006 \n                    https:\/\/doi.org\/10.1109\/IEEESTD.2006.99107\n                    \n                  . \n                    http:\/\/ieeexplore.ieee.org\/stamp\/stamp.jsp?tp=&arnumber=1603394&isnumber=33683\n                    \n                  .","DOI":"10.1109\/IEEESTD.2006.99107"},{"issue":"7","key":"1325_CR9","doi-asserted-by":"publisher","first-page":"2711","DOI":"10.1109\/18.959255","volume":"47","author":"Y. Kou","year":"2001","unstructured":"Y. Kou, S. Lin, M. P. C. Fossorier, Low-density parity-check codes based on finite geometries: a rediscovery and new results. IEEE Trans. Inform. Theory. 47(7), 2711\u20132736 (2001).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"1325_CR10","doi-asserted-by":"publisher","first-page":"1269","DOI":"10.1109\/TIT.2004.828088","volume":"50","author":"H. Tang","year":"2004","unstructured":"H. Tang, J. Xu, Y. Kou, S. Lin, K. Abdel-Ghaffar, On algebraic construction of Gallager and circulant low-density parity-check codes. IEEE Trans. Inform. Theory. 50(6), 1269\u20131279 (2004).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"1325_CR11","doi-asserted-by":"publisher","first-page":"1156","DOI":"10.1109\/TIT.2004.828066","volume":"50","author":"B. Vasic","year":"2004","unstructured":"B. Vasic, O. Milenkovic, Combinatorial constructions of low-density parity-check codes for iterative decoding. IEEE Trans. Inform. Theory. 50(6), 1156\u20131176 (2004).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"1325_CR12","doi-asserted-by":"publisher","first-page":"1444","DOI":"10.1109\/TIT.2007.892770","volume":"53","author":"N. Kamiya","year":"2007","unstructured":"N. Kamiya, High-rate quasi-cyclic low-density parity-check codes derived from finite affine planes. IEEE Trans. Inform. Theory. 53(4), 1444\u20131459 (2007).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"1325_CR13","doi-asserted-by":"publisher","first-page":"1055","DOI":"10.1093\/ietfec\/e90-a.5.1055","volume":"90","author":"M. Fujisawa","year":"2007","unstructured":"M. Fujisawa, S. Sakata, A construction of high rate quasi-cyclic regular LDPC codes from cyclic difference families with girth 8. IEICE Trans. Fundam. Electron. Commun. Comput. Sci.90(5), 1055\u20131061 (2007).","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"issue":"81","key":"1325_CR14","first-page":"44","volume":"81","author":"C. J. Colbourn","year":"1996","unstructured":"C. J. Colbourn, J. H. Dinitz, CRC handbook of combinatorial design. Math. Gaz.81(81), 44\u201348 (1996).","journal-title":"Math. Gaz."},{"key":"1325_CR15","unstructured":"W. Wen, M. Ai, J. Qiu, L. Liu, in 2015 IEEE International Conference on Progress in Informatics and Computing (PIC). Novel construction and cycle analysis of quasi-cyclic low-density parity-check codes (Nanjing, 2015), pp. 230\u2013233."},{"key":"1325_CR16","doi-asserted-by":"crossref","unstructured":"Q. Huang, Q. Diao, S. Lin, K. Abdel-Ghaffar, in 2011 Information Theory and Applications Workshop. Cyclic and quasi-cyclic LDPC codes: new developments (La Jolla, 2011), pp. 1\u201310.","DOI":"10.1109\/ITA.2011.5743581"},{"key":"1325_CR17","doi-asserted-by":"publisher","unstructured":"S. Vafi, N. Majid, Combinatorial design-based quasi-cyclic LDPC codes with girth eight. Digit. Commun. Netw.\n                    https:\/\/doi.org\/10.1016\/j.dcan.(2018)\n                    \n                  .","DOI":"10.1016\/j.dcan.(2018)"},{"key":"1325_CR18","doi-asserted-by":"crossref","unstructured":"H. Park, S. Hong, J. S. No, IEEE Trans. Commun.61(8), 3108\u20133113 (2013).","DOI":"10.1109\/TCOMM.2013.070213.120879"}],"container-title":["EURASIP Journal on Wireless Communications and Networking"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-018-1325-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13638-018-1325-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-018-1325-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,16]],"date-time":"2020-01-16T19:05:41Z","timestamp":1579201541000},"score":1,"resource":{"primary":{"URL":"https:\/\/jwcn-eurasipjournals.springeropen.com\/articles\/10.1186\/s13638-018-1325-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,17]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["1325"],"URL":"https:\/\/doi.org\/10.1186\/s13638-018-1325-9","relation":{},"ISSN":["1687-1499"],"issn-type":[{"value":"1687-1499","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,17]]},"assertion":[{"value":"19 April 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 December 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"value":"Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Publisher\u2019s Note"}}],"article-number":"14"}}