{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T13:58:53Z","timestamp":1762783133522,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,16]],"date-time":"2024-07-16T00:00:00Z","timestamp":1721088000000},"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":[[2024,7,16]]},"DOI":"10.1145\/3666000.3669686","type":"proceedings-article","created":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T13:18:51Z","timestamp":1721049531000},"page":"153-161","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Decoding Simultaneous Rational Evaluation Codes"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-4998-2475","authenticated-orcid":false,"given":"Matteo","family":"Abbondati","sequence":"first","affiliation":[{"name":"Hérault, LIRMM, Université Montpellier, CNRS, France"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-4851-5789","authenticated-orcid":false,"given":"Eleonora","family":"Guerrini","sequence":"additional","affiliation":[{"name":"LIRMM, Université Montpellier, CNRS, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0880-1190","authenticated-orcid":false,"given":"Romain","family":"Lebreton","sequence":"additional","affiliation":[{"name":"LIRMM, Université Montpellier, CNRS, France"}]}],"member":"320","published-online":{"date-parts":[[2024,7,16]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Probabilistic Analysis of LLL-based Decoder of Interleaved Chinese Remainder Codes. In ITW 2023-IEEE Information Theory Workshop.","author":"Abbondati Matteo","year":"2023","unstructured":"Matteo Abbondati, Antoine Afflatet, Eleonora Guerrini, and Romain Lebreton. 2023. Probabilistic Analysis of LLL-based Decoder of Interleaved Chinese Remainder Codes. In ITW 2023-IEEE Information Theory Workshop."},{"key":"e_1_3_2_1_2_1","volume-title":"Improved Algorithms for the Shortest Vector Problem and the Closest Vector Problem in the Infinity Norm. In 29th International Symposium on Algorithms and Computation.","author":"Aggarwal Divesh","year":"2018","unstructured":"Divesh Aggarwal and Priyanka Mukhopadhyay. 2018. Improved Algorithms for the Shortest Vector Problem and the Closest Vector Problem in the Infinity Norm. In 29th International Symposium on Algorithms and Computation."},{"key":"e_1_3_2_1_3_1","volume-title":"30th International Colloquium, ICALP 2003 Eindhoven, The Netherlands, June 30\u2013July 4, 2003 Proceedings 30","author":"Bleichenbacher Daniel","year":"2003","unstructured":"Daniel Bleichenbacher, Aggelos Kiayias, and Moti Yung. 2003. Decoding of interleaved Reed Solomon codes over noisy data. In Automata, Languages and Programming: 30th International Colloquium, ICALP 2003 Eindhoven, The Netherlands, June 30\u2013July 4, 2003 Proceedings 30. Springer, 97\u2013108."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2631948.2631956"},{"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":"publisher","DOI":"10.1145\/301250.301309"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2022.10.007"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849582"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3452143.3465548"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087604.3087645"},{"key":"e_1_3_2_1_11_1","volume-title":"ARTICLE","author":"Lenstra K","year":"1982","unstructured":"Arjen\u00a0K Lenstra, Hendrik\u00a0Willem Lenstra, and L\u00e1szl\u00f3 Lov\u00e1sz. 1982. Factoring polynomials with rational coefficients. Mathematische annalen 261, ARTICLE (1982), 515\u2013534."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620387"},{"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"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Zach Olesh and Arne Storjohann. 2007. The vector rational function reconstruction problem. In Computer Algebra 2006: Latest Advances in Symbolic Algorithms. World Scientific 137\u2013149.","DOI":"10.1142\/9789812778857_0008"},{"key":"e_1_3_2_1_16_1","unstructured":"Cl\u00e9ment Pernet. 2014. High performance and reliable algebraic computing. Ph.\u00a0D. Dissertation. Universit\u00e9 Joseph Fourier Grenoble 1."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2930889.2930933"},{"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":"A hierarchy of polynomial time lattice basis reduction algorithms. Theoretical computer science 53, 2-3","author":"Schnorr Claus-Peter","year":"1987","unstructured":"Claus-Peter Schnorr. 1987. A hierarchy of polynomial time lattice basis reduction algorithms. Theoretical computer science 53, 2-3 (1987), 201\u2013224."},{"key":"e_1_3_2_1_21_1","unstructured":"Gilles Villard. 1997. A study of Coppersmith\u2019s block Wiedemann algorithm using matrix polynomials. Technical Report."}],"event":{"name":"ISSAC '24: International Symposium on Symbolic and Algebraic Computation","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"Raleigh NC USA","acronym":"ISSAC '24"},"container-title":["Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3666000.3669686","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3666000.3669686","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T00:53:09Z","timestamp":1758588789000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3666000.3669686"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,16]]},"references-count":21,"alternative-id":["10.1145\/3666000.3669686","10.1145\/3666000"],"URL":"https:\/\/doi.org\/10.1145\/3666000.3669686","relation":{},"subject":[],"published":{"date-parts":[[2024,7,16]]},"assertion":[{"value":"2024-07-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}