{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T21:34:47Z","timestamp":1729632887259,"version":"3.28.0"},"reference-count":31,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1109\/allerton.2017.8262714","type":"proceedings-article","created":{"date-parts":[[2018,1,18]],"date-time":"2018-01-18T23:03:47Z","timestamp":1516316627000},"page":"25-30","source":"Crossref","is-referenced-by-count":3,"title":["Universally weakly secure coset coding schemes for minimum storage regenerating (MSR) codes"],"prefix":"10.1109","author":[{"given":"Swanand","family":"Kadhe","sequence":"first","affiliation":[]},{"given":"Alex","family":"Sprintson","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2309000"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557098"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1109\/ACSSC.2015.7421189","article-title":"Can linear minimum storage regenerating codes be universally secure?","author":"goparaju","year":"2015","journal-title":"2015 49th Asilomar Conference on Signals Systems and Computers"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2605118"},{"key":"ref12","volume":"abs 1608 1732","author":"rawat","year":"2016","journal-title":"A note on secure minimum storage regenerating codes"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006684"},{"key":"ref14","article-title":"Weakly Secure Network Coding","author":"bhattad","year":"2005","journal-title":"Proc NetCod"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2012.2217331"},{"journal-title":"On Block Security of Regenerating Codes at the Mbr Point for Distributed Storage Systems","year":"2013","author":"dau","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394538"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2159049"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2014.6892130"},{"key":"ref28","volume":"abs 1701 7447","author":"sasidharan","year":"2017","journal-title":"An explicit coupled-layer construction of a high-rate MSR code with low sub-packetization level small field size and $\\mathrm d"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2325570"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2661313"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2162191"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1984.tb00072.x"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513795"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/NetCod.2013.6570837"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2011.6133754"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2096170"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2288784"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2014.7028489"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2090212"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4594971"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283510"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ITWNIT.2009.5158587"},{"key":"ref26","first-page":"1","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Problems Inform Transmission"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1587\/comex.2.442"}],"event":{"name":"2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2017,10,3]]},"location":"Monticello, IL, USA","end":{"date-parts":[[2017,10,6]]}},"container-title":["2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8253908\/8262705\/08262714.pdf?arnumber=8262714","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,9]],"date-time":"2019-10-09T14:43:23Z","timestamp":1570632203000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8262714\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/allerton.2017.8262714","relation":{},"subject":[],"published":{"date-parts":[[2017,10]]}}}