{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:42:48Z","timestamp":1757313768695,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030859275"},{"type":"electronic","value":"9783030859282"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-85928-2_20","type":"book-chapter","created":{"date-parts":[[2021,9,8]],"date-time":"2021-09-08T12:12:16Z","timestamp":1631103136000},"page":"253-262","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Construction for Constant Dimension Codes from the Known Codes"],"prefix":"10.1007","author":[{"given":"Kunxiao","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yindong","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zusheng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feng","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6893-6476","authenticated-orcid":false,"given":"Xianmang","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,2]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Ahlswede, R., Ning Cai, Li, S.R., Yeung, R.W.: Network information flow. IEEE Trans. Inf. Theory 46(4), 1204\u20131216 (2000)","DOI":"10.1109\/18.850663"},{"issue":"2","key":"20_CR2","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1080\/10586458.2016.1239145","volume":"27","author":"MJ Braun","year":"2018","unstructured":"Braun, M.J., Ostergrad, P.R., Wassermann, A.: New lower bounds for binary constant-dimension subspace codes. Exp. Math. 27(2), 179\u2013183 (2018). https:\/\/doi.org\/10.1080\/10586458.2016.1239145","journal-title":"Exp. Math."},{"issue":"1","key":"20_CR3","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10623-003-4194-z","volume":"34","author":"M Braun","year":"2005","unstructured":"Braun, M., Kerber, A., Laue, R.: Systematic construction OFQ-analogs of (v, k,)-designs. Des. Codes Crypt. 34(1), 55\u201370 (2005)","journal-title":"Des. Codes Crypt."},{"issue":"2","key":"20_CR4","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1080\/10586458.2016.1239145","volume":"27","author":"M Braun","year":"2016","unstructured":"Braun, M., Ostergard, P.R.J., Wassermann, A.: New lower bounds for binary constant-dimension subspace codes. Exp. Math. 27(2), 179\u2013183 (2016). https:\/\/doi.org\/10.1080\/10586458.2016.1239145","journal-title":"Exp. Math."},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Chen, H., He, X., Weng, J., Xu, L.: New constructions of subspace codes using subsets of MRD codes in several blocks. IEEE Trans. Inf. Theory 66(9), 5317\u20135321 (2020). http:\/\/arxiv.org\/abs\/1908.03804","DOI":"10.1109\/TIT.2020.2975776"},{"key":"20_CR6","unstructured":"Cossidente, A., Kurz, S., Marino, G., Pavese, F.: Combining subspace codes. CoRR abs\/1911.03387 (2019)"},{"key":"20_CR7","unstructured":"Cruz, J.D.L., Gorla, E., Lopez, H.H., Ravagnani, A.: Rank distribution of Delsarte codes. Mathematics (2015)"},{"issue":"3","key":"20_CR8","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/0097-3165(78)90015-8","volume":"25","author":"P Delsarte","year":"1978","unstructured":"Delsarte, P.: Bilinear forms over a finite field, with applications to coding theory. J. Comb. Theory 25(3), 226\u2013241 (1978)","journal-title":"J. Comb. Theory"},{"issue":"502","key":"20_CR9","first-page":"67","volume":"173","author":"R Diestel","year":"2000","unstructured":"Diestel, R.: Graph theory. Math. Gazette 173(502), 67\u2013128 (2000)","journal-title":"Math. Gazette"},{"key":"20_CR10","unstructured":"Duo, L.: Discrete Mathematics and Applications. Tsinghua University Press (2013). (in Chinese)"},{"key":"20_CR11","unstructured":"He, X.: A hierarchical-based greedy algorithm for Echelon-Ferrers construction. arXiv (2019)"},{"issue":"7","key":"20_CR12","doi-asserted-by":"publisher","first-page":"2909","DOI":"10.1109\/TIT.2009.2021376","volume":"55","author":"T Etzion","year":"2009","unstructured":"Etzion, T., Silberstein, N.: Error-correcting codes in projective spaces via rank-metric codes and Ferrers diagrams. IEEE Trans. Inf. Theory 55(7), 2909\u20132919 (2009)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"20_CR13","doi-asserted-by":"publisher","first-page":"525","DOI":"10.3934\/amc.2016023","volume":"10","author":"H Gluesing-Luerssen","year":"2016","unstructured":"Gluesing-Luerssen, H., Troha, C.: Construction of subspace codes through linkage. Adv. Math. Commun. 10(3), 525\u2013540 (2016)","journal-title":"Adv. Math. Commun."},{"key":"20_CR14","doi-asserted-by":"publisher","first-page":"51333","DOI":"10.1109\/ACCESS.2020.2980670","volume":"8","author":"I Gutirrez-Garca","year":"2020","unstructured":"Gutirrez-Garca, I., Naizir, I.M.: Finding cliques in projective space: a method for construction of cyclic Grassmannian codes. IEEE Access 8, 51333\u201351339 (2020). https:\/\/doi.org\/10.1109\/ACCESS.2020.2980670","journal-title":"IEEE Access"},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"1875","DOI":"10.1109\/LCOMM.2020.2997928","volume":"24","author":"X He","year":"2020","unstructured":"He, X., Chen, Y., Zhang, Z.: Improving the linkage construction with Echelon-Ferrers for constant-dimension codes. IEEE Commun. Lett. 24, 1875\u20131879 (2020)","journal-title":"IEEE Commun. Lett."},{"issue":"11","key":"20_CR16","doi-asserted-by":"publisher","first-page":"2392","DOI":"10.1109\/LCOMM.2020.3012488","volume":"24","author":"X He","year":"2020","unstructured":"He, X.: Construction of constant dimension code from two parallel versions of linkage construction. IEEE Commun. Lett. 24(11), 2392\u20132395 (2020)","journal-title":"IEEE Commun. Lett."},{"key":"20_CR17","unstructured":"Heinlein, D.: Generalized linkage construction for constant-dimension codes. arxiv.org (2019)"},{"key":"20_CR18","unstructured":"Heinlein, D., Kiermaier, M., Kurz, S., Wassermann, A.: Tables of subspace codes. arxiv.org (2016)"},{"key":"20_CR19","unstructured":"Heinlein, D., Kurz, S.: COSET construction for subspace codes. IEEE Trans. Inf. Theory PP(99), 1 (2015)"},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"Heinlein, D., Kurz, S.: Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound. In: Coding Theory and Applications, ICMCTA 2017 (2017)","DOI":"10.1007\/978-3-319-66278-7_15"},{"key":"20_CR21","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Res. Logist. Quart. 2, 83\u201397 (1955)","journal-title":"Naval Res. Logist. Quart."},{"issue":"8","key":"20_CR22","doi-asserted-by":"publisher","first-page":"3579","DOI":"10.1109\/TIT.2008.926449","volume":"54","author":"R Koetter","year":"2008","unstructured":"Koetter, R., Kschischang, F.R.: Coding for errors and erasures in random network coding. IEEE Trans. Inf. Theory 54(8), 3579\u20133591 (2008)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"20_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-89994-5_4","volume-title":"Mathematical Methods in Computer Science","author":"A Kohnert","year":"2008","unstructured":"Kohnert, A., Kurz, S.: Construction of large constant dimension codes with a prescribed minimum distance. In: Calmet, J., Geiselmann, W., M\u00fcller-Quade, J. (eds.) Mathematical Methods in Computer Science. LNCS, vol. 5393, pp. 31\u201342. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89994-5_4"},{"key":"20_CR24","unstructured":"Kurz, S.: A note on the linkage construction for constant dimension codes. arXiv:1906.09780, https:\/\/arxiv.org\/abs\/1906.09780 (2019)"},{"key":"20_CR25","unstructured":"Kurz, S.: Lifted codes and the multilevel construction for constant dimension codes. arXiv:2004.14241 (2020)"},{"key":"20_CR26","unstructured":"Lao, H., Chen, H., Weng, J., Tan, X.: Parameter-controlled inserting constructions of constant dimension subspace codes. arxiv.org (2020)"},{"issue":"5","key":"20_CR27","doi-asserted-by":"publisher","first-page":"2760","DOI":"10.1109\/TIT.2019.2960343","volume":"66","author":"F Li","year":"2020","unstructured":"Li, F.: Construction of constant dimension subspace codes by modifying linkage construction. IEEE Trans. Inf. Theory 66(5), 2760\u20132764 (2020)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"20_CR28","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1109\/TIT.2002.807285","volume":"49","author":"S Li","year":"2003","unstructured":"Li, S., Yeung, R., Cai, N.: Linear network coding. IEEE Trans. Inf. Theory 49(2), 371\u2013381 (2003)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"20_CR29","first-page":"196","volume":"10","author":"J Munkres","year":"1962","unstructured":"Munkres, J.: Algorithms for the assignment and transportation problems. SIAM. J 10, 196\u2013210 (1962)","journal-title":"SIAM. J"},{"issue":"1","key":"20_CR30","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1109\/TIT.2010.2090252","volume":"57","author":"N Silberstein","year":"2011","unstructured":"Silberstein, N., Etzion, T.: Enumerative coding for Grassmannian space. IEEE Trans. Inf. Theory 57(1), 365\u2013374 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"20_CR31","doi-asserted-by":"publisher","first-page":"3937","DOI":"10.1109\/TIT.2015.2435743","volume":"61","author":"N Silberstein","year":"2015","unstructured":"Silberstein, N., Trautmann, A.L.: Subspace codes based on graph matchings, Ferrers diagrams, and pending blocks. IEEE Trans. Inf. Theory 61(7), 3937\u20133953 (2015)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"20_CR32","doi-asserted-by":"publisher","first-page":"6315","DOI":"10.1109\/TIT.2018.2839596","volume":"64","author":"L Xu","year":"2018","unstructured":"Xu, L., Chen, H.: New constant-dimension subspace codes from maximum rank-distance codes. IEEE Trans. Inf. Theory 64(9), 6315\u20136319 (2018)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Lecture Notes in Computer Science","Wireless Algorithms, Systems, and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-85928-2_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,8]],"date-time":"2021-09-08T12:18:18Z","timestamp":1631103498000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85928-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030859275","9783030859282"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85928-2_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"2 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WASA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Wireless Algorithms, Systems, and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nanjing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wasa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wasa-conference.org\/WASA2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"315","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"103","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"57","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}