{"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":1781476923384,"version":"3.54.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,8,9]],"date-time":"2022-08-09T00:00:00Z","timestamp":1660003200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,8,9]],"date-time":"2022-08-09T00:00:00Z","timestamp":1660003200000},"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":["61772147"],"award-info":[{"award-number":["61772147"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12171114"],"award-info":[{"award-number":["12171114"]}],"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,1]]},"DOI":"10.1007\/s10623-022-01095-3","type":"journal-article","created":{"date-parts":[[2022,8,9]],"date-time":"2022-08-09T13:02:41Z","timestamp":1660050161000},"page":"29-44","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Constructions of large cyclic constant dimension codes via Sidon spaces"],"prefix":"10.1007","volume":"91","author":[{"given":"He","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chunming","family":"Tang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,8,9]]},"reference":[{"issue":"3","key":"1095_CR1","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1023\/A:1008394205999","volume":"22","author":"R Ahlswede","year":"2001","unstructured":"Ahlswede R., Aydinian H.K., Khachatrian L.H.: On perfect codes and related concepts. Des. Codes Cryptogr. 22(3), 221\u2013237 (2001).","journal-title":"Des. Codes Cryptogr."},{"issue":"3","key":"1095_CR2","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1017\/S0305004117000044","volume":"163","author":"C Bachoc","year":"2017","unstructured":"Bachoc C., Serra O.: Z$$\\rm \\acute{e}$$mor: an analogue of Vosper\u2019s theorem for extension fields. Math. Proc. Cambridge Philos. Soc. 163(3), 423\u2013452 (2017).","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"issue":"3","key":"1095_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. Inf. Theory 62(3), 1157\u20131165 (2016).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"e7","key":"1095_CR4","first-page":"1","volume":"4","author":"M Braun","year":"2016","unstructured":"Braun M., Etzion T., Ostergard P., Vardy A., Wasserman A.: Existence of q-analogs of Steiner systems. Forum Math. Pi. 4(e7), 1\u201314 (2016).","journal-title":"Forum Math. Pi."},{"key":"1095_CR5","doi-asserted-by":"publisher","unstructured":"Chen B., Liu H.: Constructions of cyclic constant dimension codes. Des. Codes Cryptogr. 1\u201313 (2017). https:\/\/doi.org\/10.1007\/s10623-017-0394-9.","DOI":"10.1007\/s10623-017-0394-9"},{"key":"1095_CR6","doi-asserted-by":"crossref","unstructured":"Cheng Q., Gao S., Wan D.: Constructing high order elements through subspace polynomials. In: Proceedings of 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1463\u20131547 (2012).","DOI":"10.1137\/1.9781611973099.115"},{"issue":"1","key":"1095_CR7","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1137\/0518015","volume":"18","author":"L Chihara","year":"1987","unstructured":"Chihara L.: On the zeros of the Askey-Wilson polynomials, with applications to coding theory. SIAM J. Math. Anal. 18(1), 191\u2013207 (1987).","journal-title":"SIAM J. Math. Anal."},{"key":"1095_CR8","first-page":"49","volume":"4","author":"P Erd\u0151s","year":"1981","unstructured":"Erd\u0151s P.: Solved and unsolved problems in combinatorics and combinatorial number theory. Congr. Numer. 4, 49\u201362 (1981).","journal-title":"Congr. Numer."},{"issue":"2","key":"1095_CR9","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. Inf. Theory 57(2), 1165\u20131173 (2011).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"1095_CR10","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":"1095_CR11","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":"1095_CR12","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":"1095_CR13","doi-asserted-by":"crossref","unstructured":"Kohnert A., Kurz S.: Construction of large constant dimension codes with a prescribed minimum distance. In: Mathematical Methods in Computer Science, vol. 5393. Lecture Notes in Computer Science, pp. 31\u201342. Springer, Berlin (2008).","DOI":"10.1007\/978-3-540-89994-5_4"},{"issue":"8","key":"1095_CR14","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. Inf. Theory 54(8), 3579\u20133591 (2008).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1095_CR15","unstructured":"Li Y., Liu H.: Cyclic subspace codes via the sum of Sidon spaces arXiv:2105.12520 [cs.IT]."},{"issue":"5","key":"1095_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2019.111788","volume":"343","author":"Y Niu","year":"2020","unstructured":"Niu Y., Yue Y., 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":"1095_CR17","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":"1095_CR18","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. Inf. Theory 64(6), 4412\u20134422 (2018).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1095_CR19","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1006\/jcta.2001.3188","volume":"97","author":"M Schwartz","year":"2002","unstructured":"Schwartz M., Etzion T.: Codes and anticodes in the Grassman graph. J. Combin. Theory A 97(1), 27\u201342 (2002).","journal-title":"J. Combin. Theory A"},{"issue":"11","key":"1095_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. Inf. Theory 59(11), 7386\u20137404 (2013).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1095_CR21","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s12095-020-00463-x","volume":"13","author":"H Zhang","year":"2021","unstructured":"Zhang H., Cao X.: Further constructions of cyclic subspace codes. Cryptogr. Commun. 13, 245\u2013262 (2021).","journal-title":"Cryptogr. Commun."},{"key":"1095_CR22","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":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01095-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01095-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01095-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T10:14:40Z","timestamp":1673086480000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01095-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,9]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["1095"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01095-3","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,9]]},"assertion":[{"value":"22 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 May 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 July 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}