{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:43:43Z","timestamp":1773377023731,"version":"3.50.1"},"reference-count":19,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"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":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195316","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Covering Using Reed-Solomon Codes"],"prefix":"10.1109","author":[{"given":"Samin","family":"Riasat","sequence":"first","affiliation":[{"name":"Northeastern University,Department of Electrical and Computer Engineering,Boston,MA,USA,02115"}]},{"given":"Hessam","family":"Mahdavifar","sequence":"additional","affiliation":[{"name":"Northeastern University,Department of Electrical and Computer Engineering,Boston,MA,USA,02115"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2021.3133071"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517770"},{"key":"ref4","doi-asserted-by":"crossref","DOI":"10.1109\/ICC52391.2025.11162098","article-title":"Precoding Design for Limited-Feedback MISO Systems via Character-Polynomial Codes,","volume-title":"IEEE International Conference on Communications (ICC): Communication Theory Symposium (to appear)","author":"Gooty","year":"2025"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.82.056109"},{"key":"ref6","volume-title":"Packing and covering in higher dimensions","author":"T\u00f3th","year":"2022"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057043"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057227"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-51083-4_44"},{"key":"ref10","article-title":"Covering Codes","author":"Cohen","year":"1997","journal-title":"Elsevier"},{"key":"ref11","first-page":"755","article-title":"Covering Radius","volume":"1","author":"Brualdi","year":"1998","journal-title":"Handbook of Coding Theory"},{"issue":"2","key":"ref12","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1561\/0400000007","article-title":"Algorithmic results in list decoding,","volume":"2","author":"Guruswami","year":"2006","journal-title":"Foundations and Trends in Theoretical Computer Sciences"},{"key":"ref13","first-page":"42","article-title":"The Guruswami-Sudan Decoding Algorithm for Reed-Solomon Codes,","author":"McEliece","year":"2003","journal-title":"IPN Progress Report"},{"key":"ref14","article-title":"On the average list size for the Guruswami-Sudan decoder,","volume-title":"7th International Symposium on Communications Theory and Applications (ISCTA)","volume":"194","author":"McEliece","year":"2003"},{"key":"ref15","volume-title":"Essential Coding Theory","author":"Guruswami","year":"2022"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59663-6_12"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/18.817522"},{"key":"ref18","volume-title":"The Theory of Error-Correcting Codes, ser. Mathematical Library","author":"MacWilliams","year":"1977"},{"key":"ref19","doi-asserted-by":"crossref","DOI":"10.1109\/ISIT57864.2024.10619480","article-title":"Decoding Analog Subspace Codes: Algorithms for Character-Polynomial Codes,","volume-title":"IEEE International Symposium on Information Theory (ISIT)","author":"Riasat","year":"2024"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195316.pdf?arnumber=11195316","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:30:07Z","timestamp":1773347407000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195316\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195316","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}