{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:17:22Z","timestamp":1740133042715,"version":"3.37.3"},"reference-count":11,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Commun. Lett."],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1109\/lcomm.2020.3003132","type":"journal-article","created":{"date-parts":[[2020,6,17]],"date-time":"2020-06-17T22:02:53Z","timestamp":1592431373000},"page":"2100-2103","source":"Crossref","is-referenced-by-count":2,"title":["Generalized LMRD Code Bounds for Constant Dimension Codes"],"prefix":"10.1109","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4597-2041","authenticated-orcid":false,"given":"Sascha","family":"Kurz","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2905002"},{"key":"ref3","first-page":"3","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928291"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-66278-7_15"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2839596"},{"key":"ref5","article-title":"Tables of subspace codes","author":"heinlein","year":"2016","journal-title":"arXiv 1601 02864"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926449"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2968832"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2220119"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2435743"},{"key":"ref1","article-title":"Combining subspace codes","author":"cossidente","year":"2019","journal-title":"arXiv 1911 03387"}],"container-title":["IEEE Communications Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4234\/9218024\/09119446.pdf?arnumber=9119446","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T15:47:31Z","timestamp":1651074451000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9119446\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10]]},"references-count":11,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/lcomm.2020.3003132","relation":{},"ISSN":["1089-7798","1558-2558","2373-7891"],"issn-type":[{"type":"print","value":"1089-7798"},{"type":"electronic","value":"1558-2558"},{"type":"electronic","value":"2373-7891"}],"subject":[],"published":{"date-parts":[[2020,10]]}}}