{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:20:58Z","timestamp":1750220458132,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":8,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,18]],"date-time":"2021-07-18T00:00:00Z","timestamp":1626566400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1717100"],"award-info":[{"award-number":["CCF-1717100"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,18]]},"DOI":"10.1145\/3452143.3465525","type":"proceedings-article","created":{"date-parts":[[2021,7,13]],"date-time":"2021-07-13T22:32:21Z","timestamp":1626215541000},"page":"241-247","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Hermite Interpolation With Error Correction"],"prefix":"10.1145","author":[{"given":"Erich L.","family":"Kaltofen","sequence":"first","affiliation":[{"name":"North Carolina State University & Duke University, Raleigh, NC, USA"}]},{"given":"Cl\u00e9ment","family":"Pernet","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Grenoble Alpes, CNRS, Grenoble, France"}]},{"given":"Zhi-Hong","family":"Yang","sequence":"additional","affiliation":[{"name":"Shenzhen University, Shenzhen, China"}]}],"member":"320","published-online":{"date-parts":[[2021,7,18]]},"reference":[{"volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques,, Leslie Ann Goldberg, Klaus Jansen","author":"Guruswami Venkatesan","key":"e_1_3_2_1_1_1","unstructured":"Venkatesan Guruswami and Carol Wang. 2011. Optimal rate list decoding via derivative codes. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques,, Leslie Ann Goldberg, Klaus Jansen, R. Ravi, and Jos\u00e9 D. P. Rolim (Eds.). Springer, 593--604."},{"volume-title":"ISSAC 2014 Proc. 39th Internat","author":"Kaltofen Erich","key":"e_1_3_2_1_2_1","unstructured":"Erich Kaltofen and Cl\u00e9ment Pernet. 2014. Sparse Polynomial Interpolation Codes and Their Decoding Beyond Half the Minimal Distance. In ISSAC 2014 Proc. 39th Internat. Symp. Symbolic Algebraic Comput., Katsusuke Nabeshima (Ed.). Association for Computing Machinery, New York, N. Y., 272--279. EKhrefhttp:\/\/users.cs.duke.edu\/ elk27\/bibliography\/14\/KaPe14.pdf EKbib\/14\/KaPe14.pdf."},{"key":"e_1_3_2_1_3_1","volume-title":"CASC 2020 (Lect. Notes Comput. Sci.","volume":"357","author":"Kaltofen Erich","year":"2020","unstructured":"Erich Kaltofen, Cl\u00e9ment Pernet, and Zhi-Hong Yang. 2020. Hermite Rational Function Interpolation with Error Correction. In Computer Algebra in Scientific Computing, CASC 2020 (Lect. Notes Comput. Sci., Vol. 12291),, F. Boulier, M. England, T. Sadykov, and E. Vorozhtsov (Eds.). Springer, 335--357. EKhrefhttp:\/\/users.cs.duke.edu\/ elk27\/bibliography\/20\/KPY20.pdf EKbib\/20\/KPY20.pdf."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1837934.1837985"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/625\/12497"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2015.v011a005"},{"key":"e_1_3_2_1_7_1","first-page":"55","article-title":"Codes for the m-metric","volume":"33","author":"Rosenbloom M. Yu.","year":"1997","unstructured":"M. Yu. Rosenbloom and Michael A. Tsfasman. 1997. Codes for the m-metric. Problemy Peredachi Informatsii, Vol. 33, 1 (1997), 55--63.","journal-title":"Problemy Peredachi Informatsii"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1080\/allowbreak"}],"event":{"name":"ISSAC '21: International Symposium on Symbolic and Algebraic Computation","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"Virtual Event Russian Federation","acronym":"ISSAC '21"},"container-title":["Proceedings of the 2021 International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3452143.3465525","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3452143.3465525","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3452143.3465525","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:48:08Z","timestamp":1750193288000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3452143.3465525"}},"subtitle":["Fields of Zero or Large Characteristic and Large Error Rate"],"short-title":[],"issued":{"date-parts":[[2021,7,18]]},"references-count":8,"alternative-id":["10.1145\/3452143.3465525","10.1145\/3452143"],"URL":"https:\/\/doi.org\/10.1145\/3452143.3465525","relation":{},"subject":[],"published":{"date-parts":[[2021,7,18]]},"assertion":[{"value":"2021-07-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}