{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:33:00Z","timestamp":1772119980642,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,10,26]],"date-time":"2024-10-26T00:00:00Z","timestamp":1729900800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,26]],"date-time":"2024-10-26T00:00:00Z","timestamp":1729900800000},"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":["12171114"],"award-info":[{"award-number":["12171114"]}],"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":["Cryptogr. Commun."],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s12095-024-00749-4","type":"journal-article","created":{"date-parts":[[2024,10,26]],"date-time":"2024-10-26T01:02:39Z","timestamp":1729904559000},"page":"139-163","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Three families of large cyclic subspace codes"],"prefix":"10.1007","volume":"17","author":[{"given":"He","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunming","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xing","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,10,26]]},"reference":[{"issue":"3","key":"749_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":"749_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\u00e9mor: 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":"749_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":"749_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":"749_CR5","doi-asserted-by":"publisher","first-page":"1299","DOI":"10.1007\/s10801-023-01275-x","volume":"58","author":"C Castello","year":"2023","unstructured":"Castello, C., Polverino, O., Santonastaso, P., Zullo, F.: Constructions and equivalence of Sidon spaces. J. Algebr. Comb. 58, 1299\u20131329 (2023). https:\/\/doi.org\/10.1007\/s10801-023-01275-x","journal-title":"J. Algebr. Comb."},{"key":"749_CR6","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":"749_CR7","doi-asserted-by":"crossref","unstructured":"Cheng Q., Gao S., Wan D.: Constructing high order elements through subspace polynomials. Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23-25, 2011 ACM, (2012)","DOI":"10.1137\/1.9781611973099.115"},{"key":"749_CR8","doi-asserted-by":"publisher","unstructured":"Chiara C.:On generalized Sidon spaces. https:\/\/doi.org\/10.48550\/arXiv.2312.12245","DOI":"10.48550\/arXiv.2312.12245"},{"issue":"1","key":"749_CR9","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":"749_CR10","first-page":"49","volume":"4","author":"P Erd\u00f6s","year":"1981","unstructured":"Erd\u00f6s, P.: Solved and unsolved problems in combinatorics and combinatorial number theory. Congres Numer. 4, 49\u201362 (1981)","journal-title":"Congres Numer."},{"issue":"2","key":"749_CR11","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":"749_CR12","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. Discrete Math. 344(4), 112273 (2021)","journal-title":"Discrete Math."},{"key":"749_CR13","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":"749_CR14","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":"749_CR15","doi-asserted-by":"publisher","unstructured":"Hong X., Cao X.: Generalized block inserting for constructing new constant dimension codes. Cryptogr. Commun., (2022). https:\/\/doi.org\/10.1007\/s12095-022-00590-7","DOI":"10.1007\/s12095-022-00590-7"},{"key":"749_CR16","doi-asserted-by":"publisher","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, 31-42 Springer, Berlin (2008). https:\/\/doi.org\/10.1007\/978-3-540-89994-5-4.","DOI":"10.1007\/978-3-540-89994-5-4."},{"issue":"8","key":"749_CR17","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":"749_CR18","doi-asserted-by":"publisher","unstructured":"Lao H., Chen H.: New constant dimension subspace codes from multilevel linkage construction. Advances in Mathematics of Communications, (2022). https:\/\/doi.org\/10.3934\/amc.2022074","DOI":"10.3934\/amc.2022074"},{"key":"749_CR19","volume-title":"Finite Fields","author":"R Lidl","year":"2008","unstructured":"Lidl, R., Niederreiter, H.: Finite Fields. Cambridge University Press, Cambridge (2008)"},{"key":"749_CR20","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1007\/s10623-022-01146-9","volume":"91","author":"Y Li","year":"2023","unstructured":"Li, Y., Liu, H.: Cyclic constant dimension subspace codes via the sum of Sidon spaces. Des. Codes Cryptogr. 91, 1193\u20131207 (2023). https:\/\/doi.org\/10.1007\/s10623-022-01146-9","journal-title":"Des. Codes Cryptogr."},{"key":"749_CR21","doi-asserted-by":"publisher","unstructured":"Li Y., Liu H., and Mesnager S.: New constructions of constant dimension subspace codes with large sizes. Des. Codes Cryptogr., (2024). https:\/\/doi.org\/10.1007\/s10623-023-01350-1","DOI":"10.1007\/s10623-023-01350-1"},{"key":"749_CR22","doi-asserted-by":"publisher","first-page":"1062","DOI":"10.1587\/transfun.2022EAL2074","volume":"8","author":"X Liu","year":"2023","unstructured":"Liu, X., Shi, T., Niu, M., Shen, L., Gao, Y.: New constructions of Sidon spaces and cyclic subspace codes. IEICE Trans. Fundamentals. V.E106-A 8, 1062\u20131066 (2023)","journal-title":"IEICE Trans. Fundamentals. V.E106-A"},{"issue":"1","key":"749_CR23","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BF01390772","volume":"6","author":"WJ Martin","year":"1995","unstructured":"Martin, W.J., Zhu, X.J.: Anticodes for the Grassman and bilinear forms graphs. Des. Codes Cryptogr. 6(1), 73\u201379 (1995)","journal-title":"Des. Codes Cryptogr."},{"key":"749_CR24","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2022074","author":"M Niu","year":"2022","unstructured":"Niu, M., Xiao, J., Gao, Y.: New constructions of large cyclic subspace codes via Sidon spaces. Adv. Math. Commun. (2022). https:\/\/doi.org\/10.3934\/amc.2022074","journal-title":"Adv. Math. Commun."},{"issue":"5","key":"749_CR25","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, Y., Wu, Y.: Several kinds of large cyclic subspace codes via Sidon spaces. Discrete Math. 343(5), 111788 (2020)","journal-title":"Discrete Math."},{"issue":"2","key":"749_CR26","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":"749_CR27","doi-asserted-by":"crossref","unstructured":"Raviv, N., Langton, B., Tamo, I.: Multivariate public key cryptosystem from Sidon spaces. Cryptology ePrint Archive 254, (2021). https:\/\/eprint.iacr.org\/2021\/2542106.07785","DOI":"10.1007\/978-3-030-75245-3_10"},{"key":"749_CR28","doi-asserted-by":"crossref","unstructured":"Raviv, N., Tamo, I.: Cyclic subspace codes and Sidon spaces. IEEE Int. Symp. Inf. Theory, 784\u2013788 (2017)","DOI":"10.1109\/ISIT.2017.8006635"},{"issue":"6","key":"749_CR29","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":"749_CR30","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":"749_CR31","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":"749_CR32","unstructured":"Yu S., Ji L.: New constructions of cyclic subspace codes. arXiv:2305.15627https:\/\/doi.org\/10.48550\/arXiv.2305.15627 (2023)"},{"key":"749_CR33","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."},{"issue":"2","key":"749_CR34","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s11464-022-1011-4","volume":"17","author":"H Zhang","year":"2022","unstructured":"Zhang, H., Cao, X.: Constructions of Sidon spaces and cyclic subspace codes. Front. Math. China 17(2), 275\u2013288 (2022)","journal-title":"Front. Math. China"},{"key":"749_CR35","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10623-022-01095-3","volume":"91","author":"H Zhang","year":"2023","unstructured":"Zhang, H., Tang, C.: Constructions of large cyclic constant dimension codes via Sidon spaces. Des. Codes Cryptogr. 91, 29\u201344 (2023)","journal-title":"Des. Codes Cryptogr."},{"key":"749_CR36","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.laa.2022.12.011","volume":"661","author":"H Zhang","year":"2023","unstructured":"Zhang, H., Tang, C.: Further constructions of large cyclic subspace codes via Sidon spaces. Linear Algebra Appl. 661, 106\u2013115 (2023)","journal-title":"Linear Algebra Appl."},{"key":"749_CR37","doi-asserted-by":"publisher","unstructured":"Zhang, H., Tang, C., Hu, X.: New constructions of Sidon spaces and large cyclic constant dimension codes. Comp. Appl. Math. 42(230), (2023). https:\/\/doi.org\/10.1007\/s40314-023-02353-3","DOI":"10.1007\/s40314-023-02353-3"},{"key":"749_CR38","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1007\/s10801-021-01069-z","volume":"55","author":"T Zhang","year":"2022","unstructured":"Zhang, T., Ge, G.: New constructions of Sidon spaces. J. Algebr. Combin. 55, 781\u2013794 (2022). https:\/\/doi.org\/10.1007\/s10801-021-01069-z","journal-title":"J. Algebr. Combin."},{"key":"749_CR39","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."},{"key":"749_CR40","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2022.102153","volume":"87","author":"F Zullo","year":"2023","unstructured":"Zullo, F.: Multi-orbit cyclic subspace codes and linear sets. Finite Fields Appl. 87, 102153 (2023)","journal-title":"Finite Fields Appl."}],"updated-by":[{"DOI":"10.1007\/s12095-024-00759-2","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2024,11,28]],"date-time":"2024-11-28T00:00:00Z","timestamp":1732752000000}}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-024-00749-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-024-00749-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-024-00749-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,28]],"date-time":"2025-01-28T06:51:49Z","timestamp":1738047109000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-024-00749-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,26]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["749"],"URL":"https:\/\/doi.org\/10.1007\/s12095-024-00749-4","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-2228225\/v1","asserted-by":"object"}]},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,26]]},"assertion":[{"value":"2 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 October 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 October 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 November 2024","order":4,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Update","order":5,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The original online version of this article was revised: The funding number 61772147 is not correct. It should be 12171114.","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 November 2024","order":7,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":8,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":9,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s12095-024-00759-2","URL":"https:\/\/doi.org\/10.1007\/s12095-024-00759-2","order":10,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}]}}