{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T20:49:21Z","timestamp":1648932561438},"reference-count":18,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"11","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2020,11,1]]},"DOI":"10.1587\/transfun.2020eal2031","type":"journal-article","created":{"date-parts":[[2020,5,11]],"date-time":"2020-05-11T22:05:23Z","timestamp":1589234723000},"page":"1299-1303","source":"Crossref","is-referenced-by-count":0,"title":["Structural Analysis of Nonbinary Cyclic and Quasi-Cyclic LDPC Codes with \u03b1-Multiplied Parity-Check Matrices"],"prefix":"10.1587","volume":"E103.A","author":[{"given":"Haiyang","family":"LIU","sequence":"first","affiliation":[{"name":"Institute of Microelectronics of Chinese Academy of Sciences"}]},{"given":"Hao","family":"ZHANG","sequence":"additional","affiliation":[{"name":"Institute of Microelectronics of Chinese Academy of Sciences"}]},{"given":"Lianrong","family":"MA","sequence":"additional","affiliation":[{"name":"Department of Mathematical Sciences, Tsinghua University"}]},{"given":"Lingjun","family":"KONG","sequence":"additional","affiliation":[{"name":"College of Telecommunications and Information Engineering, Nanjing University of Posts and Telecommunications"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] Y. Kou, S. Lin, and M.P.C. Fossorier, \u201cLow-density parity-check codes based on finite geometries: A rediscovery and new results,\u201d IEEE Trans. Inf. Theory, vol.47, no.7, pp.2711-2736, Oct. 2001. 10.1109\/18.959255","DOI":"10.1109\/18.959255"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] L. Lan, L. Zeng, Y.Y. Tai, L. Chen, S. Lin, and K. Abdel-Ghaffar, \u201cConstruction of quasi-cyclic LDPC codes for AWGN and binary erasure channels: A finite field approach,\u201d IEEE Trans. Inf. Theory, vol.53, no.7, pp.2429-2458, July 2007. 10.1109\/tit.2007.899516","DOI":"10.1109\/TIT.2007.899516"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] L. Zeng, L. Lan, Y.Y. Tai, B. Zhou, S. Lin, and K. Abdel-Ghaffar, \u201cConstruction of nonbinary cyclic, quasi-cyclic and regular LDPC codes: A finite geometry approach,\u201d IEEE Trans. Commun., vol.56, no.3, pp.378-387, March 2008. 10.1109\/tcomm.2008.060025","DOI":"10.1109\/TCOMM.2008.060025"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] L. Zeng, L. Lan, Y.Y. Tai, S. Song, S. Lin, and K. Abdel-Ghaffar, \u201cConstruction of nonbinary quasi-cyclic LDPC codes: A finite field approach,\u201d IEEE Trans. Commun., vol.56, no.4, pp.545-554, April 2008. 10.1109\/tcomm.2008.060024","DOI":"10.1109\/TCOMM.2008.060024"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[6] C.-Y. Chen, Q. Huang, C.-C. Chao, and S. Lin, \u201cTwo low-complexity reliability-based message-passing algorithms for decoding non-binary LDPC codes,\u201d IEEE Trans. Commun., vol.58, no.11, pp.3140-3147, Nov. 2010. 10.1109\/tcomm.2010.091310.090327","DOI":"10.1109\/TCOMM.2010.091310.090327"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[7] X. Zhang, F. Cai, and S. Lin, \u201cLow-complexity reliability-based message-passing decoder architectures for non-binary LDPC codes,\u201d IEEE Trans. Very Large Scale Integr. (VLSI) Syst., vol.20, no.11, pp.1938-1950, Nov. 2012. 10.1109\/tvlsi.2011.2164951","DOI":"10.1109\/TVLSI.2011.2164951"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[8] Q. Diao, Q. Huang, S. Lin, and K. Abdel-Ghaffar, \u201cA matrix-theoretic approach for analyzing quasi-cyclic low-density parity-check codes,\u201d IEEE Trans. Inf. Theory, vol.58, no.6, pp.4030-4048, June 2012. 10.1109\/tit.2012.2184834","DOI":"10.1109\/TIT.2012.2184834"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[9] S. Zhao, X. Ma, X. Zhang, and B. Bai, \u201cA class of nonbinary LDPC Codes with fast encoding and decoding algorithms,\u201d IEEE Trans. Commun., vol.61, no.1, pp.1-6, Jan. 2013. 10.1109\/tcomm.2012.101712.110173","DOI":"10.1109\/TCOMM.2012.101712.110173"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[10] M. Schwartz and A. Vardy, \u201cOn the stopping distance and the stopping redundancy of codes,\u201d IEEE Trans. Inf. Theory, vol.52, no.3, pp.922-932, March 2006. 10.1109\/tit.2005.864441","DOI":"10.1109\/TIT.2005.864441"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[11] S. Xia and F. Fu, \u201cOn the stopping distance of finite geometry LDPC codes,\u201d IEEE Commun. Lett., vol.10, no.5, pp.381-383, May 2006. 10.1109\/lcomm.2006.1633330","DOI":"10.1109\/LCOMM.2006.1633330"},{"key":"11","unstructured":"[12] J.L. Fan, \u201cArray codes as low-density parity-check codes,\u201d Proc. 2nd Int. Symp. Turbo Codes, pp.543-546, Sept. 2000."},{"key":"12","doi-asserted-by":"publisher","unstructured":"[13] K. Yang and T. Helleseth, \u201cOn the minimum distance of array codes as LDPC codes,\u201d IEEE Trans. Inf. Theory, vol.49, no.12, pp.3268-3271, Dec. 2003. 10.1109\/tit.2003.820053","DOI":"10.1109\/TIT.2003.820053"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[14] K. Sugiyama and Y. Kaji, \u201cOn the minimum weight of simple full-length array LDPC codes,\u201d IEICE Trans. Fundamentals, vol.E91-A, no.6, pp.1502-1508, June 2008. 10.1093\/ietfec\/e91-a.6.1502","DOI":"10.1093\/ietfec\/e91-a.6.1502"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[15] Y. Kaji, \u201cOn the number of minimum weight codewords of SFA-LDPC codes,\u201d Proc. IEEE Int. Symp. Information Theory (ISIT), pp.70-74, Jun.\/July 2009. 10.1109\/isit.2009.5205673","DOI":"10.1109\/ISIT.2009.5205673"},{"key":"15","doi-asserted-by":"publisher","unstructured":"[16] M. Esmaeili and M.J. Amoshahy, \u201cOn the stopping distance of array code parity-check matrices,\u201d IEEE Trans. Inf. Theory, vol.55, no.8, pp.3488-3493, Aug. 2009. 10.1109\/tit.2009.2023736","DOI":"10.1109\/TIT.2009.2023736"},{"key":"16","doi-asserted-by":"publisher","unstructured":"[17] H. Liu, L. Ma, and J. Chen, \u201cOn the number of minimum stopping sets and minimum codewords of array LDPC codes,\u201d IEEE Commun. Lett., vol.14, no.7, pp.670-672, July 2010. 10.1109\/lcomm.2010.07.100427","DOI":"10.1109\/LCOMM.2010.07.100427"},{"key":"17","doi-asserted-by":"publisher","unstructured":"[18] H. Liu, L. He, and J. Chen, \u201cFurther results on the stopping distance of array LDPC matrices,\u201d IEICE Trans. Fundamentals, vol.E95-A, no.5, pp.918-926, May 2012. 10.1587\/transfun.e95.a.918","DOI":"10.1587\/transfun.E95.A.918"},{"key":"18","doi-asserted-by":"publisher","unstructured":"[19] H. Liu, G. Deng, and J. Chen, \u201cOn the minimum-weight codewords of array LDPC codes with column weight 4,\u201d IEICE Trans. Fundamentals, vol.E97-A, no.11, pp.2236-2246, Nov. 2014. 10.1587\/transfun.e97.a.2236","DOI":"10.1587\/transfun.E97.A.2236"}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E103.A\/11\/E103.A_2020EAL2031\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,7]],"date-time":"2020-11-07T03:31:30Z","timestamp":1604719890000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E103.A\/11\/E103.A_2020EAL2031\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,1]]},"references-count":18,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2020]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2020eal2031","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11,1]]}}}