{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T14:04:54Z","timestamp":1787321094443,"version":"build-2736575974"},"reference-count":27,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","funder":[{"DOI":"10.13039\/501100001711","name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","doi-asserted-by":"publisher","award":["187711"],"award-info":[{"award-number":["187711"]}],"id":[{"id":"10.13039\/501100001711","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006070","name":"Universidad de los Andes","doi-asserted-by":"publisher","award":["INV-2018-50-1392"],"award-info":[{"award-number":["INV-2018-50-1392"]}],"id":[{"id":"10.13039\/501100006070","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:p>We propose reducible algebraic curves as a mechanism to construct partial maximum distance separable codes geometrically. We obtain new general existence results, new explicit constructions, and improved estimates on the smallest field sizes over which such codes can exist. Our results are obtained by combining ideas from projective algebraic geometry, combinatorics, and probability theory.<\/jats:p>","DOI":"10.1137\/20m1356658","type":"journal-article","created":{"date-parts":[[2021,12,13]],"date-time":"2021-12-13T12:01:01Z","timestamp":1639396861000},"page":"2946-2970","source":"Crossref","is-referenced-by-count":4,"title":["Constructing Partial MDS Codes from Reducible Algebraic Curves"],"prefix":"10.1137","volume":"35","author":[{"given":"Tristram","family":"Bogart","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2685-2343","authenticated-orcid":true,"given":"Anna-Lena","family":"Horlemann-Trautmann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Karpuk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2020-1040","authenticated-orcid":true,"given":"Alessandro","family":"Neri","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mauricio","family":"Velasco","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2021,12,13]]},"reference":[{"key":"atypb1","unstructured":"N. Alon and J. H. Spencer,\n                      The Probabilistic Method\n                      , John Wiley and Sons, Hoboken, NJ, 2004."},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2252395"},{"key":"atypb3","doi-asserted-by":"crossref","unstructured":"M. Blaum, J. S. Plank, M. Schwartz, and E. Yaakobi,\n                      Partial MDS (PMDS) and sector-disk (SD) codes that tolerate the erasure of two random sectors\n                      , in Proceedings of the 2014 IEEE International Symposium on Information Theory, 2014, pp. 1792-1796.","DOI":"10.1109\/ISIT.2014.6875142"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2536720"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2016.2627569"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-2014-00820-1"},{"key":"atypb7","doi-asserted-by":"crossref","unstructured":"J. Chen, K. W. Shum, Q. Yu, and C. W. Sung,\n                      Sector-disk codes and partial MDS codes with up to three global parities\n                      , in Proceedings of the 2015 IEEE International Symposium on Information Theory, 2015, pp. 1876-1880.","DOI":"10.1109\/ISIT.2015.7282781"},{"key":"atypb8","doi-asserted-by":"crossref","unstructured":"M. Chen, C. Huang, and J. Li,\n                      On the maximally recoverable property for multi-protection group codes\n                      , in Proceedings of the 2007 IEEE International Symposium on Information Theory, 2007, pp. 486-490.","DOI":"10.1109\/ISIT.2007.4557272"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2890201"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2332338"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2990981"},{"key":"atypb12","first-page":"33","volume":"13","author":"Goppa V. D.","year":"1977","journal-title":"Problemy Peredachi Informatsii"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2988459"},{"key":"atypb14","unstructured":"J. Harris,\n                      Algebraic Geometry\n                      , Grad. Texts in Math. 133, Springer, New York, 1995."},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2020006"},{"key":"atypb16","first-page":"15","author":"Huang C.","year":"2012","journal-title":"USENIX Association"},{"key":"atypb17","first-page":"289","author":"Janson S.","year":"2002","journal-title":"Budapest"},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2924888"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-019-00705-x"},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2325570"},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1109\/18.79915"},{"key":"atypb22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2288784"},{"key":"atypb23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2321280"},{"key":"atypb24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2555813"},{"key":"atypb25","doi-asserted-by":"crossref","unstructured":"M. Tsfasman, S. Vladut, and D. Nogin,\n                      Algebraic Geometric Codes: Basic Notions\n                      , Math. Surveys Monogr. 139, AMS, Providence, RI, 2007.","DOI":"10.1090\/surv\/139"},{"key":"atypb26","doi-asserted-by":"crossref","unstructured":"J. H. van Lint,\n                      Introduction to Coding Theory\n                      , Springer, New York, 1999.","DOI":"10.1007\/978-3-642-58575-3"},{"key":"atypb27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2598149"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/20M1356658","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:07:09Z","timestamp":1787317629000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/20M1356658"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["10.1137\/20M1356658"],"URL":"https:\/\/doi.org\/10.1137\/20m1356658","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1]]}}}