{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T05:22:44Z","timestamp":1774070564319,"version":"3.50.1"},"reference-count":16,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100005144","name":"Qualcomm","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100005144","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206712","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"1009-1014","source":"Crossref","is-referenced-by-count":3,"title":["On the Structure of Higher Order MDS Codes"],"prefix":"10.1109","author":[{"given":"Harshithanjani","family":"Athi","sequence":"first","affiliation":[{"name":"International Institute of Information Technology,Signal Processing and Communications Research Center,Hyderabad,India,500032"}]},{"given":"Rasagna","family":"Chigullapally","sequence":"additional","affiliation":[{"name":"International Institute of Information Technology,Signal Processing and Communications Research Center,Hyderabad,India,500032"}]},{"given":"Prasad","family":"Krishnan","sequence":"additional","affiliation":[{"name":"International Institute of Information Technology,Signal Processing and Communications Research Center,Hyderabad,India,500032"}]},{"given":"V.","family":"Lalitha","sequence":"additional","affiliation":[{"name":"International Institute of Information Technology,Signal Processing and Communications Research Center,Hyderabad,India,500032"}]}],"member":"263","reference":[{"key":"ref13","article-title":"Improved field size bounds for higher order MDS codes","author":"brakensiek","year":"2022"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10801-021-01013-1"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s13366-018-00432-9"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00027"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3187366"},{"key":"ref10","article-title":"Generic reed-solomon codes achieve list-decoding capacity","author":"brakensiek","year":"2022","journal-title":"ArXiv"},{"key":"ref2","article-title":"List decoding for noisy channels","author":"elias","year":"1957","journal-title":"MIT Research Laboratory of Electronics Technical Report"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206712"},{"key":"ref16","first-page":"609","article-title":"Problems and results on 3-chromatic hyper-graphs and some related questions","volume":"10","author":"erd?s","year":"1975","journal-title":"Infinite and Finite Sets"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834849"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3194521"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2343224"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057714"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.782097"},{"key":"ref6","article-title":"Combinatorial list-decoding of reed-solomon codes beyond the johnson radius","author":"shangguan","year":"2019","journal-title":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing"},{"key":"ref5","article-title":"Every list-decodable code for high noise has abundant near-optimal rate puncturings","author":"rudra","year":"2013","journal-title":"Proceedings of the sixth annual ACM symposium on Theory of computing"}],"event":{"name":"2023 IEEE International Symposium on Information Theory (ISIT)","location":"Taipei, Taiwan","start":{"date-parts":[[2023,6,25]]},"end":{"date-parts":[[2023,6,30]]}},"container-title":["2023 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206429\/10206441\/10206712.pdf?arnumber=10206712","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:28:25Z","timestamp":1773347305000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206712\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206712","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}