{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T16:05:00Z","timestamp":1750694700607,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1109\/isit.2010.5513670","type":"proceedings-article","created":{"date-parts":[[2010,8,19]],"date-time":"2010-08-19T15:57:25Z","timestamp":1282233445000},"page":"1163-1167","source":"Crossref","is-referenced-by-count":3,"title":["On the threshold of Maximum-Distance Separable codes"],"prefix":"10.1109","author":[{"given":"Bruno","family":"Kindarji","sequence":"first","affiliation":[]},{"given":"Gerard","family":"Cohen","sequence":"additional","affiliation":[]},{"given":"Herve","family":"Chabanne","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"101","article-title":"Probabilistic characteristics of graphs with large connectivity","volume":"10","author":"margulis","year":"1974","journal-title":"Problemy Pereda?i Informacii"},{"article-title":"Ntl: A library for doing number theory","year":"0","author":"shoup","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.850102"},{"key":"ref13","article-title":"On the average list size for the Guruswami-Sudan decoder","author":"mceliece","year":"2003","journal-title":"ISCTA"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45465-9_21"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.911222"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2034780"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060679"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548300004466"},{"article-title":"Percolation","year":"1997","author":"grimmett","key":"ref7"},{"article-title":"Reflections on &#x201C;improved decoding of reed-solomon andalgebraic-geometric codes","year":"2002","author":"guruswami","key":"ref2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10628-6_19"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-57843-9_29"}],"event":{"name":"2010 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2010,6,13]]},"location":"Austin, TX, USA","end":{"date-parts":[[2010,6,18]]}},"container-title":["2010 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5508195\/5513230\/05513670.pdf?arnumber=5513670","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,18]],"date-time":"2017-03-18T15:27:43Z","timestamp":1489850863000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5513670\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/isit.2010.5513670","relation":{},"subject":[],"published":{"date-parts":[[2010,6]]}}}