{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T18:40:06Z","timestamp":1754073606110,"version":"3.41.2"},"reference-count":14,"publisher":"IEEE","license":[{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"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":[[2018,6]]},"DOI":"10.1109\/isit.2018.8437706","type":"proceedings-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T16:14:55Z","timestamp":1534522495000},"page":"1-5","source":"Crossref","is-referenced-by-count":6,"title":["Generalized Reed-Solomon Codes with Sparsest and Balanced Generator Matrices"],"prefix":"10.1109","author":[{"given":"Wentu","family":"Song","sequence":"first","affiliation":[{"name":"Singapore University of Technology and Design, Singapore"}]},{"given":"Kui","family":"Cai","sequence":"additional","affiliation":[{"name":"Singapore University of Technology and Design, Singapore"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006480"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006761"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006682"},{"journal-title":"Generalized Reed-Solomon Codes with Sparsest and Balanced Generator Matrix","year":"2018","author":"song","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875056"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/NetCod.2013.6570836"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.2384295"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875141"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541436"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282666"},{"key":"ref2","first-page":"651","article-title":"Distributed Reed-Solomon codes for simple multiple access networks","author":"halbawi","year":"2013","journal-title":"Proc IEEE Int Symp Inform Theory (ISIT)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620554"},{"key":"ref9","first-page":"409","article-title":"Balanced Reed-Solomon codes for all parameters","year":"2016","journal-title":"Proc IEEE Information Theory Workshop (ITW)"}],"event":{"name":"2018 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2018,6,17]]},"location":"Vail, CO, USA","end":{"date-parts":[[2018,6,22]]}},"container-title":["2018 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8410646\/8437120\/08437706.pdf?arnumber=8437706","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T18:09:00Z","timestamp":1754071740000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8437706\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/isit.2018.8437706","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}