{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T20:47:01Z","timestamp":1649018821634},"reference-count":22,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"10","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2021,10,1]]},"DOI":"10.1587\/transfun.2021eal2015","type":"journal-article","created":{"date-parts":[[2021,3,28]],"date-time":"2021-03-28T22:07:13Z","timestamp":1616969233000},"page":"1430-1434","source":"Crossref","is-referenced-by-count":0,"title":["On the List Decodability of Matrix Codes with Different Metrics"],"prefix":"10.1587","volume":"E104.A","author":[{"given":"Yang","family":"DING","sequence":"first","affiliation":[{"name":"Department of Mathematics, Shanghai University"}]},{"given":"Yuting","family":"QIU","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Shanghai University"}]},{"given":"Hongxi","family":"TONG","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Shanghai University"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] Y. Ding, \u201cOn list-decodability of random rank metric codes and subspace codes,\u201d IEEE Trans. Inf. Theory, vol.61, no.1, pp.51-59, 2015. 10.1109\/tit.2014.2371915","DOI":"10.1109\/TIT.2014.2371915"},{"key":"2","unstructured":"[2] P. Elias, \u201cList-decoding for noisy channels,\u201d Technical Report, 335, Res. Lab. Electron., MIT, Cambridge, MA, USA, 1957."},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] V. Guruswami, \u201cList decoding from erasure: Bounds and code constructions,\u201d IEEE Trans. Inf. Theory, vol.49, no.11, pp.2826-2833, 2003. 10.1109\/tit.2003.815776","DOI":"10.1109\/TIT.2003.815776"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] V. Guruswami, List Decoding of Error Correcting Codes, Lecture Notes in Computer Science, vol.3282, Springer-Verlag, New York, NY, USA, 2004. 10.1007\/b104335","DOI":"10.1007\/b104335"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] V. Guruswami, J. Hastad, and S. Kopparty, \u201cOn the list-decodability of random linear codes,\u201d Proc. 42nd Annu. ACM Symp. Theory Comput. (STOC), pp.409-416, 2010. 10.1145\/1806689.1806747","DOI":"10.1145\/1806689.1806747"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] V. Guruswami, S. Narayanan, and C. Wang, \u201cList decoding subspace codes from insertions and deletions,\u201d Proc. 3rd Innov. Theoretical Comput. Sci. Conf., pp.183-189, 2012. 10.1145\/2090236.2090252","DOI":"10.1145\/2090236.2090252"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] V. Guruswami and M. Sudan, \u201cList decoding algorithms for certain concatenated codes,\u201d Proc. 32nd Annu. ACM Symp. Theory Comput., pp.181-190, 2000. 10.1145\/335305.335327","DOI":"10.1145\/335305.335327"},{"key":"8","unstructured":"[8] V. Guruswami and C. Wang, \u201cExplicit rank-metric codes listdecodable with optimal redundancy,\u201d Electron. Colloq. Comput. Complex., vol.170, p.170, Dec. 2013."},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] V. Guruswami and C. Wang, \u201cLinear-algebraic list decoding for variants of Reed-Solomon codes,\u201d IEEE Trans. Inf. Theory, vol.59, no.6, pp.3257-3268, 2013. 10.1109\/tit.2013.2246813","DOI":"10.1109\/TIT.2013.2246813"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] V. Guruswami, C. Wang, and C. Xing, \u201cExplicit list-decodable rank-metric and subspace codes via subspace designs,\u201d IEEE Trans. Inf. Theory, vol.62, no.5, pp.2707-2718, 2016. 10.1109\/tit.2016.2544347","DOI":"10.1109\/TIT.2016.2544347"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] V. Guruswami and C. Xing, \u201cList decoding Reed-Solomon, algebraic-geometric, and Gabidulin subcodes up to the singleton bound,\u201d Proc. 45th Annu. ACM Symp. Theory Comput. (STOC), pp.843-852, 2013. 10.1145\/2488608.2488715","DOI":"10.1145\/2488608.2488715"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] V. Guruswami and C. Xing, \u201cOptimal rate list decoding of folded algebraic-geometric codes over constant-sized alphabets,\u201d SODA, 2014. 10.1137\/1.9781611973402.134","DOI":"10.1137\/1.9781611973402.134"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] R. K\u00f6tter and F.R. Kschischang, \u201cCoding for errors and erasures in random network coding,\u201d IEEE Trans. Inf. Theory, vol.54, no.8, pp.3579-3591, 2008. 10.1109\/tit.2008.926449","DOI":"10.1109\/TIT.2008.926449"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] S. Liu, C. Xing, and C. Yuan, \u201cList decoding of cover metric codes up to the singleton bound,\u201d IEEE Trans. Inf. Theory, vol.64, no.4, pp.2410-2416, 2018. 10.1109\/tit.2018.2801340","DOI":"10.1109\/TIT.2018.2801340"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] H. Mahdavifar and A. Vardy, \u201cList-decoding of subspace codes and rank-metric codes up to Singleton bound,\u201d Proc. IEEE Int. Symp. Inf. Theory (ISIT), pp.1488-1492, 2012. 10.1109\/isit.2012.6283511","DOI":"10.1109\/ISIT.2012.6283511"},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] J. Rosenthal, N. Silberstein, and A. Trautmann, \u201cOn the geometry of balls in the Grassmannian and list decoding of lifted Gabidulin codes,\u201d Des. Codes Cryptogr., vol.73, no.2, pp.393-416, 2014. 10.1007\/s10623-014-9932-x","DOI":"10.1007\/s10623-014-9932-x"},{"key":"17","doi-asserted-by":"publisher","unstructured":"[17] M. Sudan, \u201cList decoding: Algorithms and applications,\u201d SIGACT News, vol.31, no.1, pp.16-27, 2000. 10.1145\/346048.346049","DOI":"10.1145\/346048.346049"},{"key":"18","unstructured":"[18] A. Wachter-Zeh, \u201cBounds on list decoding Gabidulin codes,\u201d Proc. Int. Workshop Algebr. Combin. Coding Theory, pp.329-334, 2012."},{"key":"19","doi-asserted-by":"publisher","unstructured":"[19] A. Wachter-Zeh, \u201cBounds on list decoding of rank-metric codes,\u201d IEEE Trans. Inf. Theory, vol.59, no.11, pp.7268-7277, 2013. 10.1109\/tit.2013.2274653","DOI":"10.1109\/TIT.2013.2274653"},{"key":"20","doi-asserted-by":"publisher","unstructured":"[20] A. Wachter-Zeh, \u201cList decoding of crisscross errors,\u201d IEEE Trans. Inf. Theory, vol.63, no.1, pp.142-149, 2017 2016. 10.1109\/tit.2016.2622283","DOI":"10.1109\/TIT.2016.2622283"},{"key":"21","unstructured":"[21] J.M. Wozencraft, \u201cList decoding,\u201d Res. Lab. Electron., MIT, Cambridge, MA, USA, 1958."},{"key":"22","doi-asserted-by":"publisher","unstructured":"[22] C. Xing and C. Yuan, \u201cA new class of rank-metric codes and their list decoding beyond the unique decoding radius,\u201d IEEE Trans. Inf. Theory, vol.64, no.5, pp.3394-3402, 2018. 10.1109\/tit.2017.2780848","DOI":"10.1109\/TIT.2017.2780848"}],"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\/E104.A\/10\/E104.A_2021EAL2015\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,2]],"date-time":"2021-10-02T06:14:31Z","timestamp":1633155271000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E104.A\/10\/E104.A_2021EAL2015\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,1]]},"references-count":22,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2021]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2021eal2015","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,10,1]]},"article-number":"2021EAL2015"}}