{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:38:01Z","timestamp":1773376681246,"version":"3.50.1"},"reference-count":27,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,7,7]]},"DOI":"10.1109\/isit57864.2024.10619163","type":"proceedings-article","created":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T13:25:01Z","timestamp":1724073901000},"page":"2832-2837","source":"Crossref","is-referenced-by-count":2,"title":["An Optimal Sequence Reconstruction Algorithm for Reed-Solomon Codes"],"prefix":"10.1109","author":[{"given":"Shubhransh","family":"Singhvi","sequence":"first","affiliation":[{"name":"IIIT Hyderabad,Signal Processing & Communications Research Center,India"}]},{"given":"Roni","family":"Con","sequence":"additional","affiliation":[{"name":"Technion-Israel Institute of Technology,Department of Computer Science,Haifa,Israel,3200003"}]},{"given":"Han Mao","family":"Kiah","sequence":"additional","affiliation":[{"name":"School of Physical and Mathematical Sciences, Nanyang Technological University,Singapore"}]},{"given":"Eitan","family":"Yaakobi","sequence":"additional","affiliation":[{"name":"Technion-Israel Institute of Technology,Department of Computer Science,Haifa,Israel,3200003"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3110710"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3110710"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1126\/science.1226355"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541568"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1038\/nature11875"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.782097"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.831751"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206780"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2290045"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2015.04.002"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2508800"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.819332"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.08.003"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2007.05.043"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/isit.2004.1365486"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2006.11.016"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2008.11.005"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/18.904499"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.2000.3081"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834433"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2649493"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2649493"},{"key":"ref24","author":"Singhvi","year":"2024","journal-title":"An Optimal Sequence Reconstruction Algorithm for Reed-Solomon Codes"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2878750"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620351"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TMBMC.2016.2537305"}],"event":{"name":"2024 IEEE International Symposium on Information Theory (ISIT)","location":"Athens, Greece","start":{"date-parts":[[2024,7,7]]},"end":{"date-parts":[[2024,7,12]]}},"container-title":["2024 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10619013\/10619074\/10619163.pdf?arnumber=10619163","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:27:39Z","timestamp":1773347259000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10619163\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,7]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/isit57864.2024.10619163","relation":{},"subject":[],"published":{"date-parts":[[2024,7,7]]}}}