{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,27]],"date-time":"2024-10-27T04:12:15Z","timestamp":1730002335582,"version":"3.28.0"},"reference-count":23,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2024,4,1]]},"DOI":"10.1587\/transfun.2023eal2030","type":"journal-article","created":{"date-parts":[[2023,8,15]],"date-time":"2023-08-15T22:12:30Z","timestamp":1692137550000},"page":"670-674","source":"Crossref","is-referenced-by-count":0,"title":["On the First Separating Redundancy of Array LDPC Codes"],"prefix":"10.1587","volume":"E107.A","author":[{"given":"Haiyang","family":"LIU","sequence":"first","affiliation":[{"name":"Institute of Microelectronics, Chinese Academy of Sciences"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lianrong","family":"MA","sequence":"additional","affiliation":[{"name":"Department of Mathematical Sciences, Tsinghua University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] K.A.S. Abdel-Ghaffar and J.H. Weber, \u201cSeparating erasures from errors for decoding,\u201d Proc. IEEE Int. Symp. Inf. Theory, Toronto, Canada, pp.215-219, July 2008. 10.1109\/isit.2008.4594979","DOI":"10.1109\/ISIT.2008.4594979"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] K.A.S. Abdel-Ghaffar and J.H. Weber, \u201cParity-check matrices separating erasures from errors,\u201d IEEE Trans. Inf. Theory, vol.59, no.6, pp.3332-3346, June 2013. 10.1109\/tit.2013.2245939","DOI":"10.1109\/TIT.2013.2245939"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] K.A.S. Abdel-Ghaffar and J.H. Weber, \u201cSeparating redundancy of linear MDS codes,\u201d Proc. IEEE Int. Symp. Inf. Theory, Istanbul, Turkey, pp.7-12, July 2013. 10.1109\/isit.2013.6620555","DOI":"10.1109\/ISIT.2013.6620555"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] H. Liu, D. Kim, Y. Li, and A.Z. Jia, \u201cOn the separating redundancy of extended Hamming codes,\u201d Proc. IEEE Int. Symp. Inf. Theory, Hong Kong, China, pp.2406-2410, June 2015. 10.1109\/isit.2015.7282887","DOI":"10.1109\/ISIT.2015.7282887"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] Y. Tsunoda, Y. Fujiwara, H. Ando, and P. Vandendriessche, \u201cBounds on separating redundancy of linear codes and rates of X-codes,\u201d IEEE Trans. Inf. Theory, vol.64, no.12, pp.7577-7593, Dec. 2018. 10.1109\/tit.2018.2871477","DOI":"10.1109\/TIT.2018.2871477"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] H. Liu, Y. Li, and L. Ma, \u201cOn the second separating redundancy of LDPC codes from finite planes,\u201d IEICE Trans. Fundamentals, vol.E101-A, no.3, pp.617-622, March 2018. 10.1587\/transfun.e101.a.617","DOI":"10.1587\/transfun.E101.A.617"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] H. Liu, Y. Li, and L. Ma, \u201cOn the separating redundancy of the duals of first-order generalized Reed-Muller codes,\u201d IEICE Trans. Fundamentals, vol.E102-A, no.1, pp.310-315, Jan. 2019. 10.1587\/transfun.e102.a.310","DOI":"10.1587\/transfun.E102.A.310"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] H. Liu and L. Ma, \u201cFurther results on the separating redundancy of binary linear codes,\u201d IEICE Trans. Fundamentals, vol.E102-A, no.10, pp.1420-1425, Oct. 2019. 10.1587\/transfun.e102.a.1420","DOI":"10.1587\/transfun.E102.A.1420"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] H. Liu, L. Ma, and H. Zhang, \u201cOn the separating redundancy of ternary Golay codes,\u201d IEICE Trans. Fundamentals, vol.E104-A, no.3, pp.650-655, March 2021. 10.1587\/transfun.2020eal2079","DOI":"10.1587\/transfun.2020EAL2079"},{"key":"10","unstructured":"[10] J.L. Fan, \u201cArray codes as low-density parity-check codes,\u201d Proc. 2nd Int. Symp. Turbo Codes, pp.543-546, Sept. 2000."},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] T. Mittelholzer, \u201cEfficient encoding and minimum distance bounds of Reed-Solomon-type array codes,\u201d Proc. IEEE Int. Symp. Information Theory (ISIT), p.282, June\/July 2002. 10.1109\/isit.2002.1023554","DOI":"10.1109\/ISIT.2002.1023554"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] 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":"[13] 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":"[14] Y. Kaji, \u201cOn the number of minimum weight codewords of SFA-LDPC codes,\u201d Proc. IEEE Int. Symp. Information Theory (ISIT), pp.70-74, June\/July 2009. 10.1109\/isit.2009.5205673","DOI":"10.1109\/ISIT.2009.5205673"},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] 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":"[16] M. Esmaeili, M.H. Tadayon, and T.A. Gulliver, \u201cMore on the stopping and minimum distances of array codes,\u201d IEEE Trans. Commun., vol.59, no.3, pp.750-757, March 2011. 10.1109\/tcomm.2011.010411.100240","DOI":"10.1109\/TCOMM.2011.010411.100240"},{"key":"17","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":"18","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":"19","doi-asserted-by":"publisher","unstructured":"[19] L. Dolecek, Z. Zhang, M.J. Wainwright, V. Anantharam, and B. Nikolic, \u201cAnalysis of absorbing sets and fully absorbing sets of array-based LDPC codes,\u201d IEEE Trans. Inf. Theory, vol.56, no.1, pp.181-201, Jan. 2010. 10.1109\/tit.2009.2034781","DOI":"10.1109\/TIT.2009.2034781"},{"key":"20","doi-asserted-by":"publisher","unstructured":"[20] E. Rosnes, M.A. Ambroze, and M. Tomlinson, \u201cOn the minimum\/stopping distance of array low-density parity-check codes,\u201d IEEE Trans. Inf. Theory, vol.60, no.9, pp.5204-5214, Sept. 2014. 10.1109\/tit.2014.2333519","DOI":"10.1109\/TIT.2014.2333519"},{"key":"21","doi-asserted-by":"publisher","unstructured":"[21] H. Liu, S. Yang, G. Deng, and J. Chen, \u201cMore on the minimum distance of array LDPC codes,\u201d IEEE Commun. Lett., vol.18, no.9, pp.1479-1482, July 2010. 10.1109\/lcomm.2014.2320929","DOI":"10.1109\/LCOMM.2014.2320929"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] C.J. Colbourn and J.H. Dinitz, eds., Handbook of Combinatorial Designs, 2nd ed., Chapman & Hall\/CRC, Boca Raton, FL, 2007.","DOI":"10.1201\/9781420010541"},{"key":"23","doi-asserted-by":"crossref","unstructured":"[23] X.Y. Hu, M.P.C. Fossorier, and E. Eleftheriou, \u201cOn the computation of the minimum distance of low-density parity-check codes,\u201d Proc. IEEE International Conf. Commun., pp.767-771, 2004. 10.1109\/icc.2004.1312605","DOI":"10.1109\/ICC.2004.1312605"}],"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\/E107.A\/4\/E107.A_2023EAL2030\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,26]],"date-time":"2024-10-26T06:10:40Z","timestamp":1729923040000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E107.A\/4\/E107.A_2023EAL2030\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,1]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2023eal2030","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"type":"print","value":"0916-8508"},{"type":"electronic","value":"1745-1337"}],"subject":[],"published":{"date-parts":[[2024,4,1]]},"article-number":"2023EAL2030"}}