{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T02:00:42Z","timestamp":1760061642871,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"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"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,18]]},"DOI":"10.1145\/3452143.3465548","type":"proceedings-article","created":{"date-parts":[[2021,7,13]],"date-time":"2021-07-13T22:32:21Z","timestamp":1626215541000},"page":"171-178","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Polynomial Linear System Solving with Random Errors"],"prefix":"10.1145","author":[{"given":"Eleonora","family":"Guerrini","sequence":"first","affiliation":[{"name":"LIRMM, Universit\u00e9 Montpellier, CNRS, Montpellier, France"}]},{"given":"Romain","family":"Lebreton","sequence":"additional","affiliation":[{"name":"LIRMM, Universit\u00e9 Montpellier, CNRS, Montpellier, France"}]},{"given":"Ilaria","family":"Zappatore","sequence":"additional","affiliation":[{"name":"LIX, Inria, Palaiseau, France"}]}],"member":"320","published-online":{"date-parts":[[2021,7,18]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"470","volume":"4","author":"Berlekamp E. R.","year":"1986","unstructured":"E. R. Berlekamp and L. R. Welch. U.S. Patent 4 633 470, Dec. 1986. Error Correction of Algebraic Block Codes.","journal-title":"Patent"},{"volume-title":"Proceedings of ICALP'03","author":"Bleichenbacher D.","key":"e_1_3_2_1_2_1","unstructured":"D. Bleichenbacher, A. Kiayias, and M. Yung. 2003. Decoding of interleaved Reed-Solomon codes over noisy data. In Proceedings of ICALP'03."},{"volume-title":"Proceedings of SNC'14","author":"Boyer B.","key":"e_1_3_2_1_3_1","unstructured":"B. Boyer and E. Kaltofen. 2014. Numerical Linear System Solving with Parametric Entries by Error Correction. In Proceedings of SNC'14."},{"volume-title":"Proceedings of ISIT'04","author":"Brown A.","key":"e_1_3_2_1_4_1","unstructured":"A. Brown, L. Minder, and A. Shokrollahi. 2004. Probabilistic decoding of Interleaved RS-Codes on the Q-ary symmetric channel. In Proceedings of ISIT'04."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/800204.806310"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"J. von zur Gathen and J. Gerhard. 2013. Modern Computer Algebra 3rd ed.). Cambridge University Press.","DOI":"10.1017\/CBO9781139856065"},{"volume-title":"Proceedings of ISIT'19","author":"Guerrini E.","key":"e_1_3_2_1_7_1","unstructured":"E. Guerrini, R. Lebreton, and I. Zappatore. 2019. Polynomial Linear System Solving with Errors by Simultaneous Polynomial Reconstruction of Interleaved Reed-Solomon Codes. In Proceedings of ISIT'19."},{"volume-title":"Proceedings of ISSAC'20 (Kalamata","author":"Guerrini E.","key":"e_1_3_2_1_8_1","unstructured":"E. Guerrini, R. Lebreton, and I. Zappatore. 2020. On the Uniqueness of Simultaneous Rational Function Reconstruction. In Proceedings of ISSAC'20 (Kalamata, Messinia, Greece)."},{"volume-title":"Proceedings of ISSAC'17","author":"Kaltofen E.","key":"e_1_3_2_1_9_1","unstructured":"E. Kaltofen, C. Pernet, A. Storjohann, and C. Waddell. 2017. Early Termination in Parametric Linear System Solving and Rational Function Vector Recovery with Error Correction. In Proceedings of ISSAC'17."},{"volume-title":"Proceedings of ISSAC'13","author":"Kaltofen E. L.","key":"e_1_3_2_1_10_1","unstructured":"E. L. Kaltofen and Z. Yang. 2013. Sparse multivariate function recovery from values with noise and outlier errors. In Proceedings of ISSAC'13."},{"volume-title":"Proceedings of ISSAC'14","author":"Kaltofen E. L.","key":"e_1_3_2_1_11_1","unstructured":"E. L. Kaltofen and Z. Yang. 2014. Sparse multivariate function recovery with a high error rate in the evaluations. In Proceedings of ISSAC'14."},{"volume-title":"Proceedings of ISSAC'10","author":"Khonji M.","key":"e_1_3_2_1_12_1","unstructured":"M. Khonji, C. Pernet, J.-L. Roch, T. Roche, and T. Stalinski. 2010. Output-Sensitive Decoding for Redundant Residue Systems. In Proceedings of ISSAC'10."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/355719.355720"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1005285.1005321"},{"volume-title":"Proceedings of the Waterloo Workshop","author":"Olesh Z.","key":"e_1_3_2_1_15_1","unstructured":"Z. Olesh and A. Storjohann. 2007. The Vector Rational Function Reconstruction problem. In Proceedings of the Waterloo Workshop (Ontario, Canada). World Scientific."},{"volume-title":"Proceedings of ISSAC'2016","author":"Rosenkilde J.","key":"e_1_3_2_1_16_1","unstructured":"J. Rosenkilde and A. Storjohann. 2016. Algorithms for Simultaneous Pad\u00e9 Approximations. In Proceedings of ISSAC'2016."},{"volume-title":"Proceedings of ISIT'07","author":"Schmidt G.","key":"e_1_3_2_1_17_1","unstructured":"G. Schmidt, V. Sidorenko, and M. Bossert. 2007. Enhancing the Correcting Radius of Interleaved Reed-Solomon Decoding using Syndrome Extension Techniques. In Proceedings of ISIT'07."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2060130"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021308"},{"key":"e_1_3_2_1_20_1","volume-title":"Bell Syst. Tech. J.","volume":"27","author":"Shannon C.E.","year":"1948","unstructured":"C.E. Shannon. 1948. A mathematical theory of communication. Bell Syst. Tech. J., Vol. 27, 3 (1948)."}],"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.3465548","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3452143.3465548","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.3465548"}},"subtitle":["New Bounds and Early Termination Technique"],"short-title":[],"issued":{"date-parts":[[2021,7,18]]},"references-count":20,"alternative-id":["10.1145\/3452143.3465548","10.1145\/3452143"],"URL":"https:\/\/doi.org\/10.1145\/3452143.3465548","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"}}]}}