{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T05:39:11Z","timestamp":1729661951688,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1109\/allerton.2013.6736585","type":"proceedings-article","created":{"date-parts":[[2014,2,13]],"date-time":"2014-02-13T17:46:12Z","timestamp":1392313572000},"page":"637-644","source":"Crossref","is-referenced-by-count":3,"title":["Improved bounds and constructions for granular media coding"],"prefix":"10.1109","author":[{"given":"Artyom","family":"Sharov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ron M.","family":"Roth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"17","article-title":"Bounds and constructions for granular media coding, submitted to","author":"sharov","year":"0","journal-title":"IEEE Trans Inform Theory"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/TMAG.2008.2010676"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/18.45293"},{"key":"16","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","author":"rockafellar","year":"1970","journal-title":"Convex Analysis"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2158514"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511629389"},{"journal-title":"Introduction to Linear and Nonlinear Programming","year":"1973","author":"luenberger","key":"11"},{"key":"12","article-title":"Constrained systems and coding for recording channels","author":"marcus","year":"1998","journal-title":"Handbook of Coding Theory"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/18.59932"},{"key":"2","first-page":"3","volume":"4","author":"berge","year":"1979","journal-title":"Packing Problems and Hypergraph Theory A Survey Annals of Discrete Mathematics"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/18.623162"},{"key":"10","article-title":"Non-asymptotic upper bounds for deletion correcting codes, to be published","author":"kulkarni","year":"0","journal-title":"IEEE Trans Inform Theory"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TMAG.2010.2080667"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620314"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1987.1057385"},{"key":"4","doi-asserted-by":"crossref","DOI":"10.1002\/0471200611","author":"cover","year":"1991","journal-title":"Elements of Information Theory"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/18.79947"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620203"}],"event":{"name":"2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2013,10,2]]},"location":"Monticello, IL","end":{"date-parts":[[2013,10,4]]}},"container-title":["2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6725831\/6736491\/06736585.pdf?arnumber=6736585","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T03:51:33Z","timestamp":1498103493000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6736585\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/allerton.2013.6736585","relation":{},"subject":[],"published":{"date-parts":[[2013,10]]}}}