{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T16:47:29Z","timestamp":1729615649458,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1109\/isit.2009.5205292","type":"proceedings-article","created":{"date-parts":[[2009,8,24]],"date-time":"2009-08-24T11:09:52Z","timestamp":1251112192000},"page":"2867-2871","source":"Crossref","is-referenced-by-count":0,"title":["Packing and covering properties of subspace codes"],"prefix":"10.1109","author":[{"given":"Maximilien","family":"Gadouleau","sequence":"first","affiliation":[]},{"given":"Zhiyuan","family":"Yan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Submitted to IEEE Trans Info Theory","article-title":"construction and covering properties of constant-dimension codes","year":"2009","key":"17"},{"journal-title":"Recursive code construction for random networks","year":"2008","author":"skachek","key":"18"},{"key":"15","doi-asserted-by":"crossref","DOI":"10.37236\/1311","article-title":"tight upper bounds for the domination numbers of graphs with given order and minimum degree","volume":"4","author":"clark","year":"1997","journal-title":"The Electronic Journal of Combinatorics"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2009.090447"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-008-9221-7"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595111"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511608650"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.924697"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926449"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511754623"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"year":"0","key":"10"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/18.75248"},{"key":"6","first-page":"1","article-title":"theory of codes with maximum rank distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Problems of Information Transmission"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(78)90015-8"},{"journal-title":"On metrics for error correction in network coding","year":"2008","author":"silva","key":"4"},{"journal-title":"Covering Codes","year":"1997","author":"cohen","key":"9"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928291"}],"event":{"name":"2009 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2009,6,28]]},"location":"Seoul, South Korea","end":{"date-parts":[[2009,7,3]]}},"container-title":["2009 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5179947\/5205248\/05205292.pdf?arnumber=5205292","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,21]],"date-time":"2020-05-21T14:03:42Z","timestamp":1590069822000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5205292\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/isit.2009.5205292","relation":{},"subject":[],"published":{"date-parts":[[2009,6]]}}}