{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:23:47Z","timestamp":1775053427808,"version":"3.50.1"},"reference-count":22,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1109\/isit.2009.5205850","type":"proceedings-article","created":{"date-parts":[[2009,8,24]],"date-time":"2009-08-24T15:09:52Z","timestamp":1251126592000},"page":"2221-2225","source":"Crossref","is-referenced-by-count":7,"title":["Construction and covering properties of constant-dimension codes"],"prefix":"10.1109","author":[{"given":"Maximilien","family":"Gadouleau","sequence":"first","affiliation":[]},{"given":"Zhiyuan","family":"Yan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-74341-2"},{"key":"22","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":"17","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2009.090447"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928291"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/18.75248"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928284"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(78)90015-8"},{"key":"14","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":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.924697"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595110"},{"key":"21","author":"bannai","year":"1983","journal-title":"Algebraic Cominatorics I Association Schemes"},{"key":"3","author":"skachek","year":"2008","journal-title":"Recursive code construction for random networks"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1137\/0131021"},{"key":"2","author":"silva","year":"2008","journal-title":"On metrics for error correction in network coding"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926449"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511608650"},{"key":"7","article-title":"rate distortion theory: a mathematical basis for data compression","author":"berger","year":"1971","journal-title":"ser Information and System Sciences Series"},{"key":"6","author":"cohen","year":"1997","journal-title":"Covering Codes"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-008-9221-7"},{"key":"4","first-page":"31","article-title":"construction of large constant dimension codes with a prescribed minimum distance, mathematical methods in computer science","volume":"5393","author":"kohnert","year":"2008","journal-title":"LNCS"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(76)90017-0"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205850"}],"event":{"name":"2009 IEEE International Symposium on Information Theory - ISIT","location":"Seoul, South Korea","start":{"date-parts":[[2009,6,28]]},"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\/05205850.pdf?arnumber=5205850","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,21]],"date-time":"2020-05-21T18:03:33Z","timestamp":1590084213000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5205850\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/isit.2009.5205850","relation":{},"subject":[],"published":{"date-parts":[[2009,6]]}}}