{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T05:01:10Z","timestamp":1778302870654,"version":"3.51.4"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,8,24]],"date-time":"2022-08-24T00:00:00Z","timestamp":1661299200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,8,24]],"date-time":"2022-08-24T00:00:00Z","timestamp":1661299200000},"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":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1007\/s10623-022-01099-z","type":"journal-article","created":{"date-parts":[[2022,8,24]],"date-time":"2022-08-24T15:03:02Z","timestamp":1661353382000},"page":"83-114","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":33,"title":["The minimum locality of linear codes"],"prefix":"10.1007","volume":"91","author":[{"given":"Pan","family":"Tan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8467-9871","authenticated-orcid":false,"given":"Cuiling","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cunsheng","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunming","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhengchun","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,24]]},"reference":[{"key":"1099_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.disc.2004.05.021","volume":"301","author":"V Abatangelo","year":"2005","unstructured":"Abatangelo V., Larato B.: Near-MDS codes arising from algebraic curves. Discret. Math. 301, 5\u201319 (2005).","journal-title":"Discret. Math."},{"key":"1099_CR2","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s10623-007-9144-8","volume":"46","author":"V Abatangelo","year":"2008","unstructured":"Abatangelo V., Larato B.: Elliptic near-MDS codes over $$\\mathbf{F} _5$$. Des. Codes Cryptgr. 46, 167\u2013174 (2008).","journal-title":"Des. Codes Cryptgr."},{"key":"1099_CR3","doi-asserted-by":"crossref","unstructured":"Assmus Jr., Mattson Jr.: New 5-designs. J. Comb. Theory, 6(2), 122\u2013151 (1969)","DOI":"10.1016\/S0021-9800(69)80115-8"},{"key":"1099_CR4","first-page":"1269","volume-title":"Handbook of Coding Theory","author":"EF Assmus Jr","year":"1998","unstructured":"Assmus E.F. Jr., Key J.D.: Polynomial codes and finite geometries. In: Pless V.S., Huffman W.C. (eds.) Handbook of Coding Theory, pp. 1269\u20131343. Elsevier, Amsterdam (1998)."},{"key":"1099_CR5","doi-asserted-by":"crossref","unstructured":"Cadambe, V.R., Mazumdar A.: An upper bound on the size of locally recoverable codes. International Symposium on Network Coding, Calgary, AB, Canada, pp. 1\u20135 (2013)","DOI":"10.1109\/NetCod.2013.6570829"},{"issue":"11","key":"1099_CR6","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":"1099_CR7","unstructured":"Cai, H., Fan, C., Miao, Y., Schwartz, M., Tang, X.: Optimal locally repairable codes: an improved bound and constructions. arXiv:2011.04966v1 [cs.IT]"},{"issue":"1","key":"1099_CR8","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1109\/TCOMM.2018.2869800","volume":"67","author":"H Cai","year":"2019","unstructured":"Cai H., Cheng M., Fan C., Tang X.: Optimal locally repairable systematic codes based on packings. IEEE Trans. Commun. 67(1), 39\u201349 (2019).","journal-title":"IEEE Trans. Commun."},{"key":"1099_CR9","doi-asserted-by":"publisher","first-page":"180349","DOI":"10.1109\/ACCESS.2019.2957942","volume":"7","author":"B Chen","year":"2019","unstructured":"Chen B., Chen J.: A construction of optimal $$(r, \\delta )$$-locally recoverable codes. IEEE Access 7, 180349\u2013180353 (2019).","journal-title":"IEEE Access"},{"key":"1099_CR10","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BF00124590","volume":"9","author":"MA De Boer","year":"1996","unstructured":"De Boer M.A.: Almost MDS codes. Des. Codes Cryptogr. 9, 143\u2013155 (1996).","journal-title":"Des. Codes Cryptogr."},{"key":"1099_CR11","volume-title":"Codes from Difference Sets","author":"C Ding","year":"2015","unstructured":"Ding C.: Codes from Difference Sets. World Scientific, Singapore (2015)."},{"issue":"8","key":"1099_CR12","doi-asserted-by":"publisher","first-page":"4715","DOI":"10.1109\/TIT.2019.2907276","volume":"65","author":"C Ding","year":"2019","unstructured":"Ding C., Heng Z.: The subfield codes of ovoid codes. IEEE Trans. Inf. Theory 65(8), 4715\u20134729 (2019).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1099_CR13","doi-asserted-by":"publisher","DOI":"10.1142\/11101","volume-title":"Designs from Linear Codes","author":"C Ding","year":"2018","unstructured":"Ding C., Tang C.: Designs from Linear Codes, 2nd edn World Scientific, Singapore (2018).","edition":"2"},{"issue":"9","key":"1099_CR14","doi-asserted-by":"publisher","first-page":"5419","DOI":"10.1109\/TIT.2020.2990396","volume":"66","author":"C Ding","year":"2020","unstructured":"Ding C., Tang C.: Infinite families of near MDS codes holding $$t$$-designs. IEEE Trans. Inf. Theory 66(9), 5419\u20135428 (2020).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1\u20132","key":"1099_CR15","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/BF01222850","volume":"54","author":"S Dodunekov","year":"1995","unstructured":"Dodunekov S., Landgev I.: On near-MDS codes. J. Geom. 54(1\u20132), 30\u201343 (1995).","journal-title":"J. Geom."},{"issue":"1\u20133","key":"1099_CR16","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S0012-365X(99)00168-5","volume":"213","author":"SM Dodunekov","year":"2000","unstructured":"Dodunekov S.M., Landjev I.N.: Near-MDS codes over some small fields. Discret. Math. 213(1\u20133), 55\u201365 (2000).","journal-title":"Discret. Math."},{"key":"1099_CR17","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008247720662","volume":"10","author":"A Faldum","year":"1997","unstructured":"Faldum A., Willems W.: Codes of small defect. Des. Codes Cryptogr. 10, 341\u2013350 (1997).","journal-title":"Des. Codes Cryptogr."},{"key":"1099_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00200-003-0141-5","volume":"15","author":"M Giulietti","year":"2004","unstructured":"Giulietti M.: On the extendibility of near-MDS elliptic codes. AAECC 15, 1\u201311 (2004).","journal-title":"AAECC"},{"issue":"11","key":"1099_CR19","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"},{"key":"1099_CR20","unstructured":"Grassl M.: Bounds on the minimum distance of linear codes and quantum codes. http:\/\/www.codetables.de, 2007. Accessed 07 Jan 2021"},{"key":"1099_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10623-020-00810-2","volume":"89","author":"M Grezet","year":"2021","unstructured":"Grezet M., Hollanti C.: The complete hierarchical locality of the punctured Simplex code. Des. Codes Cryptogr. 89, 1\u201321 (2021).","journal-title":"Des. Codes Cryptogr."},{"key":"1099_CR22","doi-asserted-by":"crossref","unstructured":"Guo, A., Kopparty, S., Sudan, M.M.: New affine-invariant codes from lifting. In: Proceedings of the 4th Conference on Innovations in Theoretical Computer Science, pp. 529\u2013540 (2013)","DOI":"10.1145\/2422436.2422494"},{"issue":"11","key":"1099_CR23","doi-asserted-by":"publisher","first-page":"6268","DOI":"10.1109\/TIT.2016.2605119","volume":"62","author":"P Huang","year":"2016","unstructured":"Huang P., Yaakobi E., Uchikawa H., Siegel P.H.: Binary linear locally repairable codes. IEEE Trans. Inf. Theory 62(11), 6268\u20136283 (2016).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1099_CR24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077","volume-title":"Fundamentals of Error-Correcting Codes","author":"WC Huffman","year":"2003","unstructured":"Huffman W.C., Pless V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003)."},{"issue":"4","key":"1099_CR25","doi-asserted-by":"publisher","first-page":"2166","DOI":"10.1109\/TIT.2018.2880913","volume":"65","author":"L Jin","year":"2019","unstructured":"Jin L., Kan H.: Self-dual near MDS codes from elliptic curves. IEEE Trans. Inf. Theory 65(4), 2166\u20132170 (2019).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1099_CR26","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1109\/TIT.2019.2946627","volume":"66","author":"L Jin","year":"2020","unstructured":"Jin L., Kan H., Zhang Y.: Constructions of locally repairable codes with multiple recovering sets via rational function fields. IEEE Trans. Inf. Theory 66(1), 202\u2013209 (2020).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1099_CR27","doi-asserted-by":"publisher","first-page":"1759","DOI":"10.1007\/s10623-020-00731-0","volume":"88","author":"J Liu","year":"2020","unstructured":"Liu J., Mesnager S., Tang D.: Constructions of optimal locally recoverable codes via Dickson polynomials. Des. Codes Cryptogr. 88(2), 1759\u20131780 (2020).","journal-title":"Des. Codes Cryptogr."},{"issue":"8","key":"1099_CR28","doi-asserted-by":"publisher","first-page":"5119","DOI":"10.1109\/TIT.2021.3087082","volume":"67","author":"Y Liu","year":"2021","unstructured":"Liu Y., Ding C., Tang C.: Shortened linear codes over finite fields. IEEE Trans. Inf. Theory 67(8), 5119\u20135132 (2021).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1099_CR29","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"},{"issue":"4","key":"1099_CR30","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1109\/18.992802","volume":"48","author":"S Marcugini","year":"2002","unstructured":"Marcugini S., Milani A., Pambianco F.: NMDS codes of maximum length over $$\\mathbf{F} _q$$, $$8\\le q \\le 11,$$. IEEE Trans. Inf. Theory 48(4), 963\u2013966 (2002).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1099_CR31","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1023\/A:1008264606494","volume":"14","author":"A Maschietti","year":"1998","unstructured":"Maschietti A.: Difference set and hyperovals. Des. Codes Cryptogr. 14, 89\u201398 (1998).","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"1099_CR32","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"},{"issue":"8","key":"1099_CR33","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":"2","key":"1099_CR34","doi-asserted-by":"publisher","first-page":"1741","DOI":"10.1007\/s10623-020-00728-9","volume":"88","author":"P Tan","year":"2020","unstructured":"Tan P., Zhou Z., Sidorenko V., Parampalli U.: Two classes of optimal LRCs with information $$(r, t)$$-locality. Des. Codes Cryptogr. 88(2), 1741\u20131757 (2020).","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"1099_CR35","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1109\/TIT.2020.3032600","volume":"67","author":"C Tang","year":"2021","unstructured":"Tang C., Ding C.: An infinite family of linear codes supporting $$4$$-designs. IEEE Trans. Inf. Theory 67(1), 244\u2013254 (2021).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"1099_CR36","doi-asserted-by":"publisher","first-page":"3691","DOI":"10.1109\/TIT.2019.2959764","volume":"66","author":"C Tang","year":"2020","unstructured":"Tang C., Ding C., Xiong M.: Codes, differentially $$\\delta $$-uniform functions and $$t$$-designs. IEEE Trans. Inf. Theory 66(6), 3691\u20133703 (2020).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1099_CR37","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.ffa.2013.05.008","volume":"24","author":"H Tong","year":"2013","unstructured":"Tong H., Ding Y.: Quasi-cyclic NMDS codes. Finite Fields Appl. 24, 45\u201354 (2013).","journal-title":"Finite Fields Appl."},{"key":"1099_CR38","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-3810-9","volume-title":"Algebraic-Geometry Codes","author":"MA Tsfasmann","year":"1991","unstructured":"Tsfasmann M.A., Vladut S.G.: Algebraic-Geometry Codes. Kluwer, Dordrecht (1991)."},{"key":"1099_CR39","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.disc.2020.112277","volume":"344","author":"Q Wang","year":"2021","unstructured":"Wang Q., Heng Z.: Near MDS codes from overall polynomials. Discret. Math. 344, 4 (2021).","journal-title":"Discret. Math."},{"key":"1099_CR40","first-page":"1866","volume":"2016","author":"A Wang","year":"2015","unstructured":"Wang A., Zhang Z., Liu M.: Achieving arbitrary locality and availability in binary codes. Proc. ISIT 2016, 1866\u20131870 (2015).","journal-title":"Proc. ISIT"},{"key":"1099_CR41","unstructured":"Xing, C., Yuan, C.: Construction of optimal locally recoverable codes and connection with hypergraph. Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), pp. 1\u201398 (2019)"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01099-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01099-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01099-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T10:15:08Z","timestamp":1673086508000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01099-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,24]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["1099"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01099-z","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,24]]},"assertion":[{"value":"9 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 July 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 July 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 August 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}