{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:42:24Z","timestamp":1740148944536,"version":"3.37.3"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,12,2]],"date-time":"2022-12-02T00:00:00Z","timestamp":1669939200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,2]],"date-time":"2022-12-02T00:00:00Z","timestamp":1669939200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s12095-022-00618-y","type":"journal-article","created":{"date-parts":[[2022,12,2]],"date-time":"2022-12-02T08:09:24Z","timestamp":1669968564000},"page":"513-528","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["New upper bounds and constructions of multi-erasure locally recoverable codes"],"prefix":"10.1007","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9464-5197","authenticated-orcid":false,"given":"Fagang","family":"Li","sequence":"first","affiliation":[]},{"given":"Hao","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Huimin","family":"Lao","sequence":"additional","affiliation":[]},{"given":"Shanxiang","family":"Lyu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,2]]},"reference":[{"key":"618_CR1","doi-asserted-by":"publisher","first-page":"3481","DOI":"10.1109\/TIT.2018.2800042","volume":"64","author":"A Agarwal","year":"2018","unstructured":"Agarwal, A., Barg, A., Hu, S., Mazumdar, A., Tamo, I.: Combinatorial alphabet-dependent bounds for locally recoverable codes. IEEE Trans. Inf. Theory 64, 3481\u20133492 (2018)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"618_CR2","doi-asserted-by":"crossref","unstructured":"Agarwal, A., Mazumdar A.: Bounds on the rate of linear locally repairable codes over small alphabets. arXiv:1607.08547 (2016)","DOI":"10.1109\/ALLERTON.2016.7852349"},{"key":"618_CR3","first-page":"733","volume":"14","author":"S Ball","year":"2012","unstructured":"Ball, S.: On sets of vectors of a finite space in which every subset of basis size is a basis. J. Eur. Soc. 14, 733\u2013748 (2012)","journal-title":"J. Eur. Soc."},{"issue":"1","key":"618_CR4","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1137\/120880100","volume":"27","author":"S Ball","year":"2013","unstructured":"Ball, S., Blokhuis, A.: A bound for the maximum weight of a linear code. SIAM J. Discret. Math. 27(1), 575\u2013583 (2013)","journal-title":"SIAM J. Discret. Math."},{"key":"618_CR5","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10623-012-9658-6","volume":"65","author":"S Ball","year":"2012","unstructured":"Ball, S., De Beule, J.: On sets of vectors of a finite vector space in which every subset of basis size is a basis II. Des. Codes Cryptogr. 65, 5\u201314 (2012)","journal-title":"Des. Codes Cryptogr."},{"issue":"8","key":"618_CR6","doi-asserted-by":"publisher","first-page":"4928","DOI":"10.1109\/TIT.2017.2700859","volume":"63","author":"A Barg","year":"2017","unstructured":"Barg, A., Tamo, I., Vladut, S.: Locally recoverable codes on algebraic curves. IEEE Trans. Inform. Theory 63(8), 4928\u20134939 (2017)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"618_CR7","doi-asserted-by":"publisher","first-page":"936","DOI":"10.1109\/TIT.2019.2934134","volume":"66","author":"M Blaum","year":"2020","unstructured":"Blaum, M.: Extended integrated interleaved codes over any field with applications to locally recoverable codes. IEEE Trans. Inform. Theory 66(2), 936\u2013956 (2020)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"618_CR8","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1109\/12.364531","volume":"44","author":"M Blaum","year":"1995","unstructured":"Blaum, M., Brady, J., Bruck, J., Menon, J.: EVENODD: An efficient scheme for tolerating double disk failures in RAID architectures. IEEE Trans. Comput. 44(2), 192\u2013202 (1995)","journal-title":"IEEE Trans. Comput."},{"issue":"7","key":"618_CR9","doi-asserted-by":"publisher","first-page":"4510","DOI":"10.1109\/TIT.2013.2252395","volume":"59","author":"M Blaum","year":"2013","unstructured":"Blaum, M., Hafner, J.L., Hetzler, S.: Partial-MDS codes and their application to RAID type of architectures. IEEE Trans. Inform. Theory 59(7), 4510\u20134519 (2013)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"618_CR10","first-page":"324","volume":"3","author":"M Blaum","year":"2016","unstructured":"Blaum, M., Hetzler, S.R.: Integrated interleaved codes as locally recoverable codes: properties and performance. Int. J. Inf. Coding Theory 3(4), 324\u2013344 (2016)","journal-title":"Int. J. Inf. Coding Theory"},{"issue":"3","key":"618_CR11","doi-asserted-by":"publisher","first-page":"1497","DOI":"10.1109\/TIT.2017.2789299","volume":"64","author":"M Blaum","year":"2018","unstructured":"Blaum, M., Hetzler, S.R.: Extended product and integrated interleaved codes. IEEE Trans. Inform. Theory 64(3), 1497\u20131513 (2018)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"618_CR12","doi-asserted-by":"publisher","first-page":"3675","DOI":"10.1109\/TIT.2019.2951693","volume":"66","author":"M Blaum","year":"2020","unstructured":"Blaum, M., Hetzler, S.R.: Array codes with local properties. IEEE Trans. Inform. Theory 66(6), 3675\u20133690 (2020)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"618_CR13","doi-asserted-by":"publisher","first-page":"2673","DOI":"10.1109\/TIT.2016.2536720","volume":"62","author":"M Blaum","year":"2016","unstructured":"Blaum, M., Plank, J.S., Schwartz, M., Yaakobi, E.: Construction of partial MDS and sector-disk codes with two global parity symbols. IEEE Trans. Inform. Theory 62(5), 2673\u20132681 (2016)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"618_CR14","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1109\/18.179343","volume":"39","author":"M Blaum","year":"1993","unstructured":"Blaum, M., Roth, R.M.: New array codes for multiple phased burst correction. IEEE Trans. Inform. Theory 39(1), 66\u201377 (1993)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"12","key":"618_CR15","doi-asserted-by":"publisher","first-page":"4049","DOI":"10.1016\/j.disc.2008.12.002","volume":"309","author":"IG Bouyukliev","year":"2009","unstructured":"Bouyukliev, I.G.: Classification of Griesmer codes and dual transform. Discret. Math. 309(12), 4049\u20134068 (2009)","journal-title":"Discret. Math."},{"key":"618_CR16","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s10623-010-9443-3","volume":"61","author":"EJ Cheon","year":"2011","unstructured":"Cheon, E.J.: The non-existence of Griesmer codes with parameters close to codes of Belov type. Des. Codes Cryptogr. 61, 131\u2013139 (2011)","journal-title":"Des. Codes Cryptogr."},{"key":"618_CR17","doi-asserted-by":"crossref","unstructured":"Cadambe, V., Mazumdar, A.: An upper bound on the size of locally recoverable codes. In: International symposium on network coding, pp. 1\u20135 (2013)","DOI":"10.1109\/NetCod.2013.6570829"},{"issue":"11","key":"618_CR18","doi-asserted-by":"publisher","first-page":"5787","DOI":"10.1109\/TIT.2015.2477406","volume":"61","author":"VR Cadambe","year":"2015","unstructured":"Cadambe, V.R., Mazumdar, A.: Bounds on the size of locally recoverable codes. IEEE Trans. Inf Theory 61(11), 5787\u20135794 (2015)","journal-title":"IEEE Trans. Inf Theory"},{"key":"618_CR19","doi-asserted-by":"crossref","unstructured":"Cadambe, V.R., Mazumdar, A.: Alphabet-size dependent bounds for exact repair in distributed storage. In: Proceedings IEEE information theory workshop-fall (ITW), pp. 1\u20133 (2015)","DOI":"10.1109\/ITWF.2015.7360722"},{"issue":"8","key":"618_CR20","doi-asserted-by":"publisher","first-page":"4853","DOI":"10.1109\/TIT.2020.2977647","volume":"66","author":"H Cai","year":"2020","unstructured":"Cai, H., Miao, Y., Schwartz, M., Tang, X.: On optimal locally repairable codes with super-linear length. IEEE Trans. Inf. Theory 66(8), 4853\u20134868 (2020)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"618_CR21","doi-asserted-by":"publisher","first-page":"2786","DOI":"10.1109\/TIT.2021.3052749","volume":"67","author":"H Chen","year":"2021","unstructured":"Chen, H., Weng, J., Luo, W., Xu, L.: Long optimal and small-defect LRC codes with unbounded minimum distances. IEEE Trans. Inf. Theory 67 (5), 2786\u20132792 (2021)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"618_CR22","doi-asserted-by":"publisher","first-page":"5253","DOI":"10.1109\/TCOMM.2019.2916085","volume":"67","author":"B Chen","year":"2019","unstructured":"Chen, B., Fang, W., Xia, S.T., Fu, F.W.: Constructions of optimal (\u03b3, \u03b4) locally repairable codes via constacyclic codes. IEEE Trans. Commun. 67(8), 5253\u20135263 (2019)","journal-title":"IEEE Trans. Commun."},{"issue":"4","key":"618_CR23","doi-asserted-by":"publisher","first-page":"2499","DOI":"10.1109\/TIT.2017.2761120","volume":"64","author":"B Chen","year":"2018","unstructured":"Chen, B., Xia, S.T., Hao, J., Fu, F.W.: Construction of optimal cyclic (\u03b3, \u03b4) locally repairable codes. IEEE Trans. Inf Theory 64(4), 2499\u20132511 (2018)","journal-title":"IEEE Trans. Inf Theory"},{"key":"618_CR24","doi-asserted-by":"publisher","first-page":"101650","DOI":"10.1016\/j.ffa.2020.101650","volume":"63","author":"W Fang","year":"2020","unstructured":"Fang, W., Fu, F.W.: Optimal cyclic (\u03b3, \u03b4) locally repairable codes with unbounded length. Finite Fields Appl. 63, 101650 (2020)","journal-title":"Finite Fields Appl."},{"key":"618_CR25","volume-title":"Redundant disk arrays","author":"GA Gibson","year":"1992","unstructured":"Gibson, G.A.: Redundant disk arrays. MIT Press, Cambridge (1992)"},{"issue":"9","key":"618_CR26","doi-asserted-by":"publisher","first-page":"5245","DOI":"10.1109\/TIT.2014.2332338","volume":"60","author":"P Gopalan","year":"2014","unstructured":"Gopalan, P., Huang, C., Jenkins, B., Yekhanin, S.: Explicit maximally recoverable codes with locality. IEEE Trans. Inform. Theory 60(9), 5245\u20135256 (2014)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"11","key":"618_CR27","doi-asserted-by":"publisher","first-page":"6925","DOI":"10.1109\/TIT.2012.2208937","volume":"58","author":"P Gopalan","year":"2012","unstructured":"Gopalan, P., Huang, C., Simitci, H., Yekhanin, S.: On the locality of codeword symbols. IEEE Trans. Inf. Theory 58(11), 6925\u20136934 (2012)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"618_CR28","doi-asserted-by":"publisher","first-page":"6089","DOI":"10.1109\/TIT.2019.2911595","volume":"65","author":"M Grezet","year":"2019","unstructured":"Grezet, M., Freij-Hollanti, R., Westerb\u00e4ck, T., Hollanti, C.: Alphabet-dependent bounds for linear locally repairable codes based on residual codes. IEEE Trans. Inf. Theory 65(10), 6089\u20136100 (2019)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"618_CR29","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0012-365X(93)90404-H","volume":"116","author":"N Hamada","year":"1993","unstructured":"Hamada, N.: A characterization of some [n, k, d; q]-codes meeting the Griesmer bound using a minihyper in a finite projective geometry. Discret. Math. 116, 229\u2013268 (1993)","journal-title":"Discret. Math."},{"issue":"12","key":"618_CR30","doi-asserted-by":"publisher","first-page":"7465","DOI":"10.1109\/TIT.2020.3021707","volume":"66","author":"J Hao","year":"2020","unstructured":"Hao, J., Xia, S.T., Shum, K.W., Chen, B., Fu, F.W., Yang, Y.: Bounds and constructions of locally repairable codes: parity-check matrix approach. IEEE Trans. Inf. Theory 66(12), 7465\u20137474 (2020)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"618_CR31","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/S0019-9958(81)90184-4","volume":"50","author":"T Helleseth","year":"1981","unstructured":"Helleseth, T.: A characterisation of codesmeeting the Griesmer bound. Inf. Control 50(2), 128\u2013159 (1981)","journal-title":"Inf. Control"},{"issue":"5","key":"618_CR32","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1109\/TIT.1981.1056405","volume":"27","author":"T Helleseth","year":"1981","unstructured":"Helleseth, T., vanTiborg, H.C.A.: A new class of codes meeting the Griesmer bound. IEEE Trans. Inf. Theory 27(5), 548\u2013555 (1981)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"618_CR33","doi-asserted-by":"crossref","unstructured":"Hill, R., Kolev, E.: A survey of recent results on optimal linear codes. In: Combinatorial designs and their applications (Milton Keynes, 1997), pp. 127-152, Chapman Hall\/CRC, Boca Raton (1999)","DOI":"10.1201\/9781315139722-7"},{"key":"618_CR34","unstructured":"Holzbaur, L., Freij-Hollanti, R., Wachter-Zeh, A.: Cyclic codes with locality and availability. arXiv:1812.06897 (2018)"},{"key":"618_CR35","doi-asserted-by":"crossref","unstructured":"Huang, C., Chen, M., Li, J.: Pyramid codes: flexible schemes to trade space for access efficiency in reliable data storage systems. In: Proceedings of the IEEE international symposium network computing and applications (NCA 2007), pp. 79\u201386 (2007)","DOI":"10.1109\/NCA.2007.37"},{"issue":"5","key":"618_CR36","doi-asserted-by":"publisher","first-page":"2609","DOI":"10.1109\/TIT.2019.2962012","volume":"66","author":"P Huang","year":"2020","unstructured":"Huang, P., Yaakobi, E., Siegel, P.H.: Multi-erasure locally recoverable codes over small fields: a tensor product approach. IEEE Trans. Inf. Theory 66 (5), 2609\u20132624 (2020)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"618_CR37","doi-asserted-by":"publisher","first-page":"4658","DOI":"10.1109\/TIT.2019.2901492","volume":"65","author":"L Jin","year":"2019","unstructured":"Jin, L.: Explicit construction of optimal locally recoverable codes of distance 5 and 6 via binary constant weight codes. IEEE Trans. Inf. Theory 65(8), 4658\u20134663 (2019)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"618_CR38","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1016\/j.disc.2015.09.030","volume":"339","author":"K Kumegawa","year":"2016","unstructured":"Kumegawa, K., Maruta, T.: Nonexistence of some Griesmer codes over $\\mathbb {F}_{q}$. Discret. Math. 339, 515\u2013521 (2016)","journal-title":"Discret. Math."},{"issue":"1","key":"618_CR39","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1109\/TIT.2018.2844216","volume":"65","author":"X Li","year":"2019","unstructured":"Li, X., Ma, L., Xing, C.: Optimal locally repairable codes via elliptic curves. IEEE Trans. Inf. Theory 65(1), 108\u2013117 (2019)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"618_CR40","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1109\/TIT.2017.2713245","volume":"64","author":"J Liu","year":"2018","unstructured":"Liu, J., Mesnager, S., Chen, L.: New constructions of optimal locally recoverable codes via good polynomials. IEEE Trans. Inf. Theory 64(2), 889\u2013899 (2018)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"618_CR41","doi-asserted-by":"publisher","first-page":"1048","DOI":"10.1109\/TIT.2018.2854717","volume":"65","author":"Y Luo","year":"2019","unstructured":"Luo, Y., Xing, C., Yuan, C.: Optimal locally repairable codes of distance 3 and 4 via cyclic codes. IEEE Trans. Inf. Theory 65(2), 1048\u20131053 (2019)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"618_CR42","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00150863","volume":"60","author":"T Maruta","year":"1996","unstructured":"Maruta, T.: On the nonexistence of Griesmer codes attaining the Griesmer bound. Geom. Dedicata 60, 1\u20137 (1996)","journal-title":"Geom. Dedicata"},{"issue":"1","key":"618_CR43","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1109\/TIT.2019.2939464","volume":"66","author":"G Micheli","year":"2020","unstructured":"Micheli, G.: Constructions of locally recoverable codes which are optimal. IEEE Trans. Inf. Theory 66(1), 167\u2013175 (2020)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"618_CR44","doi-asserted-by":"crossref","unstructured":"Prakash, N., Kamath, G.M., Lalitha, V., Kumar, P.V.: Optimal linear codes with a local-error-correction property. In: 2012 IEEE international symposium on information theory proceedings, IEEE. pp. 2776\u20132780 (2012)","DOI":"10.1109\/ISIT.2012.6284028"},{"issue":"3","key":"618_CR45","doi-asserted-by":"publisher","first-page":"1596","DOI":"10.1109\/TIT.2020.3043759","volume":"67","author":"J Qiu","year":"2021","unstructured":"Qiu, J., Zheng, D.B., Fu, F.W.: New constructions of optimal cyclic (\u03b3, \u03b4) locally repairable codes from their zeros. IEEE Trans. Inf. Theory 67(3), 1596\u20131608 (2021)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"618_CR46","doi-asserted-by":"crossref","unstructured":"Silberstein, N., Rawat, A., Koyluoglu, O., Vishwanath, S.: Optimal locally repairable codes via rank-metric codes. In: IEEE international symposium on information theory (ISIT), pp. 1819\u20131823 (2013)","DOI":"10.1109\/ISIT.2013.6620541"},{"key":"618_CR47","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/s10623-017-0358-0","volume":"86","author":"N Silberstein","year":"2018","unstructured":"Silberstein, N., Zeh, A.: Anticode-based locally repairable codes with high availability. Des. Codes. Cryptogr. 86, 419\u2013445 (2018)","journal-title":"Des. Codes. Cryptogr."},{"issue":"8","key":"618_CR48","doi-asserted-by":"publisher","first-page":"4661","DOI":"10.1109\/TIT.2014.2321280","volume":"60","author":"I Tamo","year":"2014","unstructured":"Tamo, I., Barg, A.: A family of optimal locally recoverable codes. IEEE Trans. Inf. Theory 60(8), 4661\u20134676 (2014)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"618_CR49","doi-asserted-by":"publisher","first-page":"3070","DOI":"10.1109\/TIT.2016.2518663","volume":"62","author":"I Tamo","year":"2016","unstructured":"Tamo, I., Barg, A., Frolov, A.: Bounds on the parameters of locally recoverable codes. IEEE Trans. Inf. Theory 62(6), 3070\u20133083 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"618_CR50","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/S0019-9958(80)90115-1","volume":"44","author":"HCA vanTiborg","year":"1980","unstructured":"vanTiborg, H.C.A.: On the uniqueness resp. nonexistence of certain codes meeting the Griesmer bound. Inf. Control 44(1), 16\u201335 (1980)","journal-title":"Inf. Control"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-022-00618-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-022-00618-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-022-00618-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,29]],"date-time":"2023-03-29T07:07:45Z","timestamp":1680073665000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-022-00618-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,2]]},"references-count":50,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["618"],"URL":"https:\/\/doi.org\/10.1007\/s12095-022-00618-y","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"type":"print","value":"1936-2447"},{"type":"electronic","value":"1936-2455"}],"subject":[],"published":{"date-parts":[[2022,12,2]]},"assertion":[{"value":"7 April 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 November 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 December 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Ethics approval and consent to participate"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Consent for Publication"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Competing interests"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Availability of supporting data"}},{"value":"Fagang Li, Hao Chen, Huimin Lao, and Shanxiang Lyu(corresponding author) are with the College of Information Science and Technology\/Cyber Security, Jinan University, Guangzhou, Guangdong Province, 510632, China (e-mail: lifagang13@mails.ucas.ac.cn, haochen@jnu.edu.cn, laohuimin@stu2018.jnu.edu.cn, lsx07@jnu.edu.cn).","order":6,"name":"Ethics","group":{"name":"EthicsHeading","label":"Authors\u2019 information"}}]}}