{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T09:37:37Z","timestamp":1771234657540,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,1,9]],"date-time":"2021-01-09T00:00:00Z","timestamp":1610150400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,9]],"date-time":"2021-01-09T00:00:00Z","timestamp":1610150400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","award":["422479"],"award-info":[{"award-number":["422479"]}],"id":[{"id":"10.13039\/100000893","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s10623-020-00823-x","type":"journal-article","created":{"date-parts":[[2021,1,9]],"date-time":"2021-01-09T18:49:25Z","timestamp":1610218165000},"page":"447-470","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["Distance Distributions of Cyclic Orbit Codes"],"prefix":"10.1007","volume":"89","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2780-192X","authenticated-orcid":false,"given":"Heide","family":"Gluesing-Luerssen","sequence":"first","affiliation":[]},{"given":"Hunter","family":"Lehmann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,9]]},"reference":[{"issue":"3","key":"823_CR1","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.1109\/TIT.2016.2520479","volume":"62","author":"E Ben-Sasson","year":"2016","unstructured":"Ben-Sasson E., Etzion T., Gabizon A., Raviv N.: Subspace polynomials and cyclic subspace codes. IEEE Trans. Inform. Theory 62(3), 1157\u20131165 (2016).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"823_CR2","doi-asserted-by":"crossref","first-page":"e7","DOI":"10.1017\/fmp.2016.5","volume":"4","author":"M Braun","year":"2016","unstructured":"Braun M., Etzion T., \u00d6sterg\u00e5rd P.R.J., Vardy A., Wassermann A.: Existence of $$q$$-analogs of Steiner systems. Forum Math Pi 4, e7 (2016).","journal-title":"Forum Math Pi"},{"issue":"6","key":"823_CR3","doi-asserted-by":"publisher","first-page":"1267","DOI":"10.1007\/s10623-017-0394-9","volume":"86","author":"B Chen","year":"2018","unstructured":"Chen B., Liu H.: Constructions of cyclic constant dimension codes. Des. Codes Cryptogr. 86(6), 1267\u20131279 (2018).","journal-title":"Des. Codes Cryptogr."},{"key":"823_CR4","unstructured":"Cossidente, A., Kurz, S., Marino, G., Pavese, F.: Combining subspace codes. Preprint 2019. arXiv: 1911.03387, (2019)"},{"key":"823_CR5","doi-asserted-by":"crossref","unstructured":"Drudge K.: On the orbits of Singer groups and their subgroups. Electron. J. Combin. 9:#R15, (2002)","DOI":"10.37236\/1632"},{"key":"823_CR6","unstructured":"Elsenhans A.-S., Kohnert A.: Constructing network codes using M\u00f6bius transformations. Preprint 2010. https:\/\/math.uni-paderborn.de\/fileadmin\/mathematik\/AG-Computeralgebra\/Preprints-elsenhans\/net_moebius_homepage.pdf."},{"key":"823_CR7","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.1109\/TIT.2010.2095232","volume":"57","author":"T Etzion","year":"2011","unstructured":"Etzion T., Vardy A.: Error-correcting codes in projective space. IEEE Trans. Inform. Theory 57, 1165\u20131173 (2011).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"823_CR8","doi-asserted-by":"publisher","first-page":"177","DOI":"10.3934\/amc.2015.9.177","volume":"9","author":"H Gluesing-Luerssen","year":"2015","unstructured":"Gluesing-Luerssen H., Morrison K., Troha C.: Cyclic orbit codes and stabilizer subfields. Adv. Math. Commun. 9(2), 177\u2013197 (2015).","journal-title":"Adv. Math. Commun."},{"key":"823_CR9","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, 525\u2013540 (2016).","journal-title":"Adv. Math. Commun."},{"key":"823_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70293-3","volume-title":"Network Coding and Subspace Designs","author":"M Greferath","year":"2018","unstructured":"Greferath M., Pav\u010devi\u0107 M., Silberstein N., V\u00e1zques-Castro M.: Network Coding and Subspace Designs. Springer, New York (2018)."},{"key":"823_CR11","unstructured":"Heinlein D., Kiermaier M., Kurz S., Wassermann A.: Tables of subspaces codes. Preprint 2016. arXiv: 1601.02864."},{"key":"823_CR12","doi-asserted-by":"publisher","first-page":"7651","DOI":"10.1109\/TIT.2017.2753822","volume":"63","author":"D Heinlein","year":"2017","unstructured":"Heinlein D., Kurz S.: Coset construction for subspace codes. IEEE Trans. Inform. Theory 63, 7651\u20137660 (2017).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"823_CR13","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1090\/conm\/632\/12627","volume":"632","author":"T Honold","year":"2015","unstructured":"Honold T., Kiermaier M., Kurz S.: Optimal binary subspace codes of length $$6$$, constant dimension $$3$$ and minimum subspace distance $$4$$. Contemp. Math. 632, 157\u2013176 (2015).","journal-title":"Contemp. Math."},{"key":"823_CR14","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. Inform. Theory 54, 3579\u20133591 (2008).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"823_CR15","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10623-016-0297-1","volume":"85","author":"K Otal","year":"2017","unstructured":"Otal K., \u00d6zbudak F.: Cyclic subspace codes via subspace polynomials. Des. Codes Cryptogr. 85(2), 191\u2013204 (2017).","journal-title":"Des. Codes Cryptogr."},{"issue":"6","key":"823_CR16","doi-asserted-by":"publisher","first-page":"4412","DOI":"10.1109\/TIT.2017.2766178","volume":"64","author":"RM Roth","year":"2018","unstructured":"Roth R.M., Raviv N., Tamo I.: Construction of Sidon spaces with applications to coding. IEEE Trans. Inform. Theory 64(6), 4412\u20134422 (2018).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"823_CR17","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. Inform. Theory 61, 3937\u20133953 (2015).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"823_CR18","first-page":"237","volume":"21","author":"S Thomas","year":"1987","unstructured":"Thomas S.: Designs over finite fields. Geom. Dedicata 21, 237\u2013242 (1987).","journal-title":"Geom. Dedicata"},{"issue":"11","key":"823_CR19","doi-asserted-by":"publisher","first-page":"7386","DOI":"10.1109\/TIT.2013.2274266","volume":"59","author":"AL Trautmann","year":"2013","unstructured":"Trautmann A.L., Manganiello F., Braun M., Rosenthal J.: Cyclic orbit codes. IEEE Trans. Inform. Theory 59(11), 7386\u20137404 (2013).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"823_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ffa.2019.01.002","volume":"57","author":"W Zhao","year":"2019","unstructured":"Zhao W., Tang X.: A characterization of cyclic subspace codes via subspace polynomials. Finite Fields Appl. 57, 1\u201312 (2019).","journal-title":"Finite Fields Appl."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-020-00823-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-020-00823-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-020-00823-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,24]],"date-time":"2021-02-24T20:20:52Z","timestamp":1614198052000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-020-00823-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,9]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["823"],"URL":"https:\/\/doi.org\/10.1007\/s10623-020-00823-x","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,9]]},"assertion":[{"value":"11 December 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 October 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 November 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 January 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}