{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T13:17:06Z","timestamp":1761743826190,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1109\/isit.2013.6620279","type":"proceedings-article","created":{"date-parts":[[2013,10,11]],"date-time":"2013-10-11T22:57:32Z","timestamp":1381532252000},"page":"514-518","source":"Crossref","is-referenced-by-count":10,"title":["New lower bounds for constant dimension codes"],"prefix":"10.1109","author":[{"given":"Natalia","family":"Silberstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna-Lena","family":"Trautmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"17","first-page":"405","article-title":"New improvements on the echelon-Ferrers construction","author":"trautmann","year":"2010","journal-title":"Proc Inter Symp Mathematical Theory Networks Syst"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928291"},{"journal-title":"A Lower Bound for Constant Dimension Codes from Multi-component Lifted MRD Codes","year":"0","author":"trautmann","key":"16"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2039163"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620279"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595113"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/18.75248"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2220119"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021376"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205280"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511987045"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2048447"},{"key":"6","first-page":"443","article-title":"Multicomponent network coding","author":"gabidulin","year":"2011","journal-title":"Proc Workshop on Coding and Cryptography"},{"key":"5","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":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095232"},{"key":"9","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/978-3-540-89994-5_4","article-title":"Construction of large constant-dimension codes with a prescribed minimum distance","volume":"5393","author":"kohnert","year":"2008","journal-title":"Lecture Notes in Computer Science"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926449"}],"event":{"name":"2013 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2013,7,7]]},"location":"Istanbul, Turkey","end":{"date-parts":[[2013,7,12]]}},"container-title":["2013 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6597029\/6620166\/06620279.pdf?arnumber=6620279","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T19:45:51Z","timestamp":1498074351000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6620279\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/isit.2013.6620279","relation":{},"subject":[],"published":{"date-parts":[[2013,7]]}}}