{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:55:36Z","timestamp":1730274936463,"version":"3.28.0"},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1109\/isit.2015.7282666","type":"proceedings-article","created":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T22:09:52Z","timestamp":1443737392000},"page":"1302-1306","source":"Crossref","is-referenced-by-count":7,"title":["Coding with constraints: Minimum distance bounds and systematic constructions"],"prefix":"10.1109","author":[{"given":"Wael","family":"Halbawi","sequence":"first","affiliation":[]},{"given":"Matthew","family":"Thill","sequence":"additional","affiliation":[]},{"given":"Babak","family":"Hassibi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/NCA.2007.37"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284027"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620540"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284028"},{"key":"ref15","first-page":"1","article-title":"Codes with local regeneration","author":"kamath","year":"2013","journal-title":"Inf Theory Appl Workshop 2013"},{"article-title":"Optimal Locally Repairable and Secure Codes for Distributed Storage Systems","year":"2012","author":"rawat","key":"ref16"},{"key":"ref17","article-title":"Storage Capacity of Repairable Networks","author":"mazumdar","year":"2014","journal-title":"arXiv 1408 4862"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"journal-title":"A Course in Combinatorics","year":"2011","author":"van lint","key":"ref19"},{"key":"ref4","first-page":"1","article-title":"On Simple Multiple Access Networks","volume":"8716","year":"2014","journal-title":"IEEE J Sel Areas Commun"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875141"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875056"},{"key":"ref5","first-page":"1","article-title":"Weakly Secure Network Coding for Wireless Cooperative Data Exchange","author":"yan","year":"2011","journal-title":"Proc 2011 IEEE Global Telecommun Conf (GLOBECOM 2011)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2014.6892135"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874913"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620554"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095130"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557599"}],"event":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2015,6,14]]},"location":"Hong Kong, Hong Kong","end":{"date-parts":[[2015,6,19]]}},"container-title":["2015 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7270906\/7282397\/07282666.pdf?arnumber=7282666","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,24]],"date-time":"2017-03-24T20:09:09Z","timestamp":1490386149000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7282666\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/isit.2015.7282666","relation":{},"subject":[],"published":{"date-parts":[[2015,6]]}}}