{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T22:42:03Z","timestamp":1781476923999,"version":"3.54.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,11,13]],"date-time":"2022-11-13T00:00:00Z","timestamp":1668297600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,13]],"date-time":"2022-11-13T00:00:00Z","timestamp":1668297600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871025"],"award-info":[{"award-number":["11871025"]}],"id":[{"id":"10.13039\/501100001809","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":[[2023,4]]},"DOI":"10.1007\/s10623-022-01146-9","type":"journal-article","created":{"date-parts":[[2022,11,13]],"date-time":"2022-11-13T11:02:51Z","timestamp":1668337371000},"page":"1193-1207","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Cyclic constant dimension subspace codes via the sum of Sidon spaces"],"prefix":"10.1007","volume":"91","author":[{"given":"Yun","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3503-8220","authenticated-orcid":false,"given":"Hongwei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,11,13]]},"reference":[{"issue":"3","key":"1146_CR1","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1017\/S0305004117000044","volume":"163","author":"C Bachoc","year":"2017","unstructured":"Bachoc C., Serra O., Zemor G.: An analogue of Vosper\u2019s theorem for extension fields. Math. Proc. Camb. Philos. Soc. 163(3), 423\u2013452 (2017).","journal-title":"Math. Proc. Camb. Philos. Soc."},{"issue":"1","key":"1146_CR2","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1109\/TIT.2009.2034780","volume":"56","author":"E Ben-Sasson","year":"2010","unstructured":"Ben-Sasson E., Kopparty S., Radhakrishnan J.: Subspace polynomials and limits to list decoding of Reed\u2013Solomon codes. IEEE Trans. Inform. Theory 56(1), 113\u2013120 (2010).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"1146_CR3","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"},{"issue":"6","key":"1146_CR4","doi-asserted-by":"publisher","first-page":"1267","DOI":"10.1007\/s10623-017-0394-9","volume":"86","author":"B Chen","year":"2017","unstructured":"Chen B., Liu H.: Constructions of cyclic constant dimension codes. Des. Codes Cryptogr. 86(6), 1267\u20131279 (2017).","journal-title":"Des. Codes Cryptogr."},{"issue":"2","key":"1146_CR5","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(2), 1165\u20131173 (2011).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"1146_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2020.112273","volume":"344","author":"T Feng","year":"2021","unstructured":"Feng T., Wang Y.: New constructions of large cyclic subspace codes and Sidon spaces. Discret. Math. 344(4), 112273 (2021).","journal-title":"Discret. Math."},{"key":"1146_CR7","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s10623-020-00823-x","volume":"89","author":"H Gluesing-Luerssen","year":"2021","unstructured":"Gluesing-Luerssen H., Lehmann H.: Distance distributions of cyclic orbit codes. Des. Codes Cryptogr. 89, 447\u2013470 (2021).","journal-title":"Des. Codes Cryptogr."},{"issue":"2","key":"1146_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":"1146_CR9","unstructured":"Gluesing-Luerssen H., Lehmann H.: Automorphism groups and isometries for cyclic orbit codes. arXiv:2101.09548"},{"issue":"4","key":"1146_CR10","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1145\/1402946.1403004","volume":"38","author":"S Katti","year":"2008","unstructured":"Katti S., Katabi D., Balakrishnan H., Medard M.: Symbol-level network coding for wireless mesh networks. ACM SIGCOMM Comput. Commun. Rev. 38(4), 401\u2013412 (2008).","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"1146_CR11","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-89994-5_4","volume":"5393","author":"A Kohnert","year":"2008","unstructured":"Kohnert A., Kurz S.: Constructing of large constant dimension codes with a prescribed minimum distance. Math. Methods Comput. Sci. 5393, 31\u201342 (2008).","journal-title":"Math. Methods Comput. Sci."},{"issue":"8","key":"1146_CR12","doi-asserted-by":"publisher","first-page":"3579","DOI":"10.1109\/TIT.2008.926449","volume":"54","author":"R K\u00f6tter","year":"2008","unstructured":"K\u00f6tter R., Kschischang F.R.: Coding for errors and erasures in random network coding. IEEE Trans. Inform. Theory 54(8), 3579\u20133591 (2008).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1146_CR13","volume-title":"Finite Fields","author":"R Lidl","year":"1997","unstructured":"Lidl R., Niederreiter H.: Finite Fields. Cambridge University Press, Cambridge (1997)."},{"issue":"5","key":"1146_CR14","doi-asserted-by":"publisher","first-page":"111788","DOI":"10.1016\/j.disc.2019.111788","volume":"343","author":"Y Niu","year":"2020","unstructured":"Niu Y., Yue Q., Wu Y.: Several kinds of large cyclic subspace codes via Sidon spaces. Discret. Math. 343(5), 111788 (2020).","journal-title":"Discret. Math."},{"issue":"2","key":"1146_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."},{"key":"1146_CR16","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s10623-012-9691-5","volume":"66","author":"J Rosenthal","year":"2013","unstructured":"Rosenthal J., Trautmann A.L.: A complete characterization of irreducible cyclic orbit codes and their Pl\u00fccker embedding. Des. Codes Cryptogr. 66, 275\u2013289 (2013).","journal-title":"Des. Codes Cryptogr."},{"issue":"6","key":"1146_CR17","doi-asserted-by":"publisher","first-page":"4412","DOI":"10.1109\/TIT.2017.2766178","volume":"64","author":"R Roth","year":"2017","unstructured":"Roth R., Raviv N., Tamo I.: Construction of Sidon spaces with applications to coding. IEEE Trans. Inform. Theory 64(6), 4412\u20134422 (2017).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"9","key":"1146_CR18","doi-asserted-by":"publisher","first-page":"3951","DOI":"10.1109\/TIT.2008.928291","volume":"54","author":"D Silva","year":"2008","unstructured":"Silva D., Kschischang F.R., K\u00f6tter R.: A rank-metric approach to error control in random network coding. IEEE Trans. Inform. Theory 54(9), 3951\u20133967 (2008).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"1146_CR19","doi-asserted-by":"publisher","first-page":"147","DOI":"10.3934\/amc.2013.7.147","volume":"7","author":"AL Trautmann","year":"2013","unstructured":"Trautmann A.L.: Isometry and automorphisms of constant dimension codes. Adv. Math. Commun. 7(2), 147\u2013160 (2013).","journal-title":"Adv. Math. Commun."},{"issue":"11","key":"1146_CR20","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"},{"issue":"2","key":"1146_CR21","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10623-008-9221-7","volume":"50","author":"S Xia","year":"2009","unstructured":"Xia S., Fu F.: Johnson type bounds on constant dimension codes. Des. Codes Cryptogr. 50(2), 163\u2013172 (2009).","journal-title":"Des. Codes Cryptogr."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01146-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01146-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01146-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,5]],"date-time":"2023-04-05T06:58:51Z","timestamp":1680677931000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01146-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,13]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["1146"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01146-9","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,13]]},"assertion":[{"value":"20 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 August 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 October 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 November 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}