{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T14:18:03Z","timestamp":1778336283906,"version":"3.51.4"},"reference-count":31,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AMC"],"published-print":{"date-parts":[[2016]]},"DOI":"10.3934\/amc.2016023","type":"journal-article","created":{"date-parts":[[2016,8,12]],"date-time":"2016-08-12T11:14:28Z","timestamp":1471000468000},"page":"525-540","source":"Crossref","is-referenced-by-count":62,"title":["Construction of subspace codes through linkage"],"prefix":"10.3934","volume":"10","author":[{"given":"Heide","family":"Gluesing-Luerssen","sequence":"first","affiliation":[]},{"given":"Carolyn","family":"Troha","sequence":"additional","affiliation":[]}],"member":"2321","reference":[{"key":"key-10.3934\/amc.2016023-1","doi-asserted-by":"crossref","unstructured":"A. Beutelspacher, Partial spreads in finite projective spaces and partial designs, <em>Math. Zeit.<\/em>, <strong>145<\/strong> (1975), 211-229.","DOI":"10.1007\/BF01215286"},{"key":"key-10.3934\/amc.2016023-2","unstructured":"<em>Forum Math. PI<\/em>, to appear."},{"key":"key-10.3934\/amc.2016023-3","doi-asserted-by":"publisher","unstructured":"M. Braun and J. Reichelt, $q$-analogs of packing designs, <em>J. Comb. Designs<\/em>, <strong>22<\/strong> (2014), 306-321.","DOI":"10.1002\/jcd.21376"},{"key":"key-10.3934\/amc.2016023-4","doi-asserted-by":"publisher","unstructured":"T. Bu, Partitions of a vector space, <em>Discr. Math.<\/em>, <strong>31<\/strong> (1980), 79-83.","DOI":"10.1016\/0012-365X(80)90174-0"},{"key":"key-10.3934\/amc.2016023-5","doi-asserted-by":"publisher","unstructured":"J. de la Cruz, M. Kiermaier, A. Wassermann and W. Willems, Algebraic structures of MRD Codes, <em>Adv. Math. Commun.<\/em>, <strong>10<\/strong> (2016), 499-510.","DOI":"10.3934\/amc.2016021"},{"key":"key-10.3934\/amc.2016023-6","doi-asserted-by":"publisher","unstructured":"P. Delsarte, Bilinear forms over a finite field, with applications to coding theory, <em>J. Combin. Theory Ser. A<\/em>, <strong>25<\/strong> (1978), 226-241.","DOI":"10.1016\/0097-3165(78)90015-8"},{"key":"key-10.3934\/amc.2016023-7","doi-asserted-by":"publisher","unstructured":"D. A. Drake and J. W. Freeman, Partial $t$-spreads and group constructible $(s,r,\\mu)$-nets, <em>J. Geom.<\/em>, <strong>13<\/strong> (1979), 210-216.","DOI":"10.1007\/BF01919756"},{"key":"key-10.3934\/amc.2016023-8","doi-asserted-by":"publisher","unstructured":"S. El-Zanati, H. Jordon, G. Seelinger, P. Sissokho and L. Spence, The maximum size of a partial $3$-spread in a finite vector space over $\\mathbb F_2$ <em>Des. Codes Cryptogr.<\/em>, <strong>54<\/strong> (2010), 101-107.","DOI":"10.1007\/s10623-009-9311-1"},{"key":"key-10.3934\/amc.2016023-9","unstructured":"A. Elsenhans, A. Kohnert and A. Wassermann, Construction of codes for network coding, in <em>Proc. 19th Int. Symp. Math. Theory Netw. Syst.<\/em>, Budapest, 2010, 1811-1814."},{"key":"key-10.3934\/amc.2016023-10","doi-asserted-by":"publisher","unstructured":"T. Etzion and N. Silberstein, Error-correcting codes in projective spaces via rank-metric codes and Ferrers diagrams, <em>IEEE Trans. Inform. Theory<\/em>, <strong>IT-55<\/strong> (2009), 2909-2919.","DOI":"10.1109\/TIT.2009.2021376"},{"key":"key-10.3934\/amc.2016023-11","doi-asserted-by":"publisher","unstructured":"T. Etzion and N. Silberstein, Codes and designs related to lifted MRD codes, <em>IEEE Trans. Inform. Theory<\/em>, <strong>IT-59<\/strong> (2013), 1004-1017.","DOI":"10.1109\/TIT.2012.2220119"},{"key":"key-10.3934\/amc.2016023-12","doi-asserted-by":"publisher","unstructured":"T. Etzion and A. Vardy, Error-correcting codes in projective space, <em>IEEE Trans. Inform. Theory<\/em>, <strong>IT-57<\/strong> (2011), 1165-1173.","DOI":"10.1109\/TIT.2010.2095232"},{"key":"key-10.3934\/amc.2016023-13","unstructured":"E. M. Gabidulin, Theory of codes with maximal rank distance, <em>Probl. Inf. Transm.<\/em>, <strong>21<\/strong> (1985), 1-12."},{"key":"key-10.3934\/amc.2016023-14","doi-asserted-by":"publisher","unstructured":"E. M. Gabidulin and M. Bossert, Algebraic codes for network coding, <em>Probl. Inf. Trans. (Engl. Transl.)<\/em>, <strong>45<\/strong> (2009), 343-356.","DOI":"10.1134\/S003294600904005X"},{"key":"key-10.3934\/amc.2016023-15","doi-asserted-by":"publisher","unstructured":"E. M. Gabidulin and N. I. Pilipchuk, Rank subcodes in multicomponent network coding, <em>Probl. Inf. Trans. (Engl. Transl.)<\/em>, <strong>49<\/strong> (2013), 40-53.","DOI":"10.1134\/S0032946013010043"},{"key":"key-10.3934\/amc.2016023-16","doi-asserted-by":"publisher","unstructured":"E. M. Gabidulin, N. I. Pilipchuk and M. Bossert, Decoding of random network codes, <em>Probl. Inf. Trans. (Engl. Transl.)<\/em>, <strong>46<\/strong> (2010), 300-320.","DOI":"10.1134\/S0032946010040034"},{"key":"key-10.3934\/amc.2016023-17","doi-asserted-by":"publisher","unstructured":"H. Gluesing-Luerssen, K. Morrison and C. Troha, Cyclic orbit codes and stabilizer subfields, <em>Adv. Math. Commun.<\/em>, <strong>9<\/strong> (2015), 177-197.","DOI":"10.3934\/amc.2015.9.177"},{"key":"key-10.3934\/amc.2016023-18","doi-asserted-by":"publisher","unstructured":"E. Gorla, F. Manganiello and J. Rosenthal, An algebraic approach for decoding spread codes, <em>Adv. Math. Commun.<\/em>, <strong>6<\/strong> (2012), 443-466.","DOI":"10.3934\/amc.2012.6.443"},{"key":"key-10.3934\/amc.2016023-19","doi-asserted-by":"publisher","unstructured":"E. Gorla and A. Ravagnani, Partial spreads in random network coding, <em>Finite Fields Appl.<\/em>, <strong>26<\/strong> (2014), 104-115.","DOI":"10.1016\/j.ffa.2013.11.007"},{"key":"key-10.3934\/amc.2016023-20","unstructured":"B. S. Hernandez and V. P. Sison, Grassmannian codes as lifts of matrix codes derived as images of linear block codes over finite fields, <em>Global J. Pure Appl. Math.<\/em>, <strong>12<\/strong> (2016), 1801-1820."},{"key":"key-10.3934\/amc.2016023-21","doi-asserted-by":"publisher","unstructured":"T. Honold, M. Kiermaier and S. Kurz, Optimal binary subspace codes of length $6$, constant dimension $3$ and minimum subspace distance $4$, <em>Contemp. Math.<\/em>, <strong>632<\/strong> (2015), 157-176.","DOI":"10.1090\/conm\/632\/12627"},{"key":"key-10.3934\/amc.2016023-22","doi-asserted-by":"publisher","unstructured":"A. Khaleghi, D. Silva and F. R. Kschischang, Subspace codes, in <em>Proc. 12th IMA Conf. Crypt. Coding<\/em>, Cirencester, 2009, 1-21.","DOI":"10.1007\/978-3-642-10868-6_1"},{"key":"key-10.3934\/amc.2016023-23","doi-asserted-by":"publisher","unstructured":"R. Koetter and F. R. Kschischang, Coding for errors and erasures in random network coding, <em>IEEE Trans. Inform. Theory<\/em>, <strong>IT-54<\/strong> (2008), 3579-3591.","DOI":"10.1109\/TIT.2008.926449"},{"key":"key-10.3934\/amc.2016023-24","doi-asserted-by":"publisher","unstructured":"A. Kohnert and S. Kurz, Construction of large constant dimension codes with a prescribed minimum distance, in <em>Mathematical Methods in Computer Science<\/em> (eds. J. Calmet, W. Geiselmann and J. M\u00fcller-Quade), Springer, Berlin, 2008, 31-42.","DOI":"10.1007\/978-3-540-89994-5_4"},{"key":"key-10.3934\/amc.2016023-25","doi-asserted-by":"publisher","unstructured":"J. Rosenthal and A.-L. Trautmann, A complete characterization of irreducible cyclic orbit codes and their Pl\u00fccker embedding, <em>Des. Codes Cryptogr.<\/em>, <strong>66<\/strong> (2013), 275-289.","DOI":"10.1007\/s10623-012-9691-5"},{"key":"key-10.3934\/amc.2016023-26","doi-asserted-by":"publisher","unstructured":"N. Silberstein and A.-L. Trautmann, Subspace codes based on graph matchings, Ferrers diagrams, and pending blocks, <em>IEEE Trans. Inform. Theory<\/em>, <strong>IT-61<\/strong> (2015), 3937-3953.","DOI":"10.1109\/TIT.2015.2435743"},{"key":"key-10.3934\/amc.2016023-27","doi-asserted-by":"publisher","unstructured":"D. Silva and F. R. Kschischang, On metrics for error correction in network coding, <em>IEEE Trans. Inform. Theory<\/em>, <strong>IT-55<\/strong> (2009), 5479-5490.","DOI":"10.1109\/TIT.2009.2032817"},{"key":"key-10.3934\/amc.2016023-28","doi-asserted-by":"publisher","unstructured":"D. Silva, F. R. Kschischang and R. K\u00f6tter, A rank-metric approach to error control in random network coding, <em>IEEE Trans. Inform. Theory<\/em>, <strong>IT-54<\/strong> (2008), 3951-3967.","DOI":"10.1109\/TIT.2008.928291"},{"key":"key-10.3934\/amc.2016023-29","doi-asserted-by":"publisher","unstructured":"V. Skachek, Recursive code construction for random networks, <em>IEEE Trans. Inform. Theory<\/em>, <strong>IT-56<\/strong> (2010), 1378-1382.","DOI":"10.1109\/TIT.2009.2039163"},{"key":"key-10.3934\/amc.2016023-30","doi-asserted-by":"publisher","unstructured":"A.-L. Trautmann, F. Manganiello, M. Braun and J. Rosenthal, Cyclic orbit codes, <em>IEEE Trans. Inform. Theory<\/em>, <strong>IT-59<\/strong> (2013), 7386-7404.","DOI":"10.1109\/TIT.2013.2274266"},{"key":"key-10.3934\/amc.2016023-31","unstructured":"A.-L. Trautmann and J. Rosenthal, New improvements on the Echelon Ferrers construction, in <em>Proc. 19th Int. Symp. Math. Theory Netw. Syst.<\/em>, Budapest, 2010, 405-408."}],"container-title":["Advances in Mathematics of Communications"],"original-title":[],"link":[{"URL":"http:\/\/www.aimsciences.org\/journals\/displayArticlesnew.jsp?paperID=12781","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T10:07:10Z","timestamp":1772791630000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.aimsciences.org\/\/article\/doi\/10.3934\/amc.2016023"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016]]}},"URL":"https:\/\/doi.org\/10.3934\/amc.2016023","relation":{},"ISSN":["1930-5346","1930-5338"],"issn-type":[{"value":"1930-5346","type":"print"},{"value":"1930-5338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}