{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T06:22:20Z","timestamp":1774851740347,"version":"3.50.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T00:00:00Z","timestamp":1771200000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T00:00:00Z","timestamp":1771200000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["12171114"],"award-info":[{"award-number":["12171114"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["12171114"],"award-info":[{"award-number":["12171114"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"the Natural Science Foundation of Jiangsu Province","award":["BK20230867"],"award-info":[{"award-number":["BK20230867"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s10623-025-01770-1","type":"journal-article","created":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T06:54:49Z","timestamp":1771224889000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Multi-orbit cyclic subspace codes via direct sum of Sidon spaces"],"prefix":"10.1007","volume":"94","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":"Xiwang","family":"Cao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,16]]},"reference":[{"issue":"3","key":"1770_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."},{"key":"1770_CR2","doi-asserted-by":"crossref","unstructured":"Bachoc C., Serra O., Z\u00e9mor G.: An analogue of Vosper\u2019s theorem for extension fields. Math. Proc. Camb. Philos. Soc. 163(3), 423\u2013452 (2017).","DOI":"10.1017\/S0305004117000044"},{"issue":"3","key":"1770_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"},{"key":"1770_CR4","volume-title":"A Polynomial Time Key-Recovery Attack on the Sidon Cryptosystem: Lecture Notes in Computer Science","author":"P Briaud","year":"2022","unstructured":"Briaud P., Tillich J.P., Verbel J.: A Polynomial Time Key-Recovery Attack on the Sidon Cryptosystem: Lecture Notes in Computer Science, vol. 13203. Springer, Cham (2022)."},{"key":"1770_CR5","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/j.laa.2024.10.015","volume":"704","author":"C Castello","year":"2025","unstructured":"Castello C.: On generalized Sidon spaces. Linear Algebra Appl. 704, 270\u2013308 (2025).","journal-title":"Linear Algebra Appl."},{"key":"1770_CR6","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).","journal-title":"J. Algebr. Comb."},{"key":"1770_CR7","unstructured":"Castello C., Santonastaso P.: Asymptotically optimal cyclic subspace codes (2025). https:\/\/arxiv.org\/abs\/2507.09290."},{"key":"1770_CR8","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, 1267\u20131279 (2018).","journal-title":"Des. Codes Cryptogr."},{"key":"1770_CR9","doi-asserted-by":"crossref","unstructured":"Cheng Q., Gao S., Wan D.: Constructing high order elements through subspace polynomials. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, 23\u201325 January 2011. ACM (2012).","DOI":"10.1137\/1.9781611973099.115"},{"key":"1770_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. Congr. Numer. 4, 49\u201362 (1981).","journal-title":"Congr. Numer."},{"issue":"2","key":"1770_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":"1770_CR12","doi-asserted-by":"publisher","first-page":"112273","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":"1770_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":"1770_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":"1770_CR15","doi-asserted-by":"publisher","first-page":"1527","DOI":"10.1007\/s12095-024-00735-w","volume":"16","author":"Y Han","year":"2024","unstructured":"Han Y., Cao X.: A new construction of cyclic subspace codes. Cryptogr. Commun. 16, 1527\u20131537 (2024).","journal-title":"Cryptogr. Commun."},{"key":"1770_CR16","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: Lecture Notes in Computer Science, vol. 5393, pp. 31\u201342. Springer, Berlin (2008).","DOI":"10.1007\/978-3-540-89994-5_4"},{"issue":"8","key":"1770_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":"1770_CR18","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).","journal-title":"Des. Codes Cryptogr."},{"key":"1770_CR19","doi-asserted-by":"publisher","first-page":"1423","DOI":"10.1007\/s10623-023-01350-1","volume":"92","author":"Y Li","year":"2024","unstructured":"Li Y., Liu H., Mesnager S.: New constructions of constant dimension subspace codes with large sizes. Des. Codes Cryptogr. 92, 1423\u20131437 (2024).","journal-title":"Des. Codes Cryptogr."},{"key":"1770_CR20","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. Fundam. 8, 1062\u20131066 (2023).","journal-title":"IEICE Trans. Fundam."},{"issue":"1","key":"1770_CR21","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 Grassmann and bilinear forms graphs. Des. Codes Cryptogr. 6(1), 73\u201379 (1995).","journal-title":"Des. Codes Cryptogr."},{"issue":"4","key":"1770_CR22","doi-asserted-by":"publisher","first-page":"1123","DOI":"10.3934\/amc.2022074","volume":"18","author":"M Niu","year":"2024","unstructured":"Niu M., Xiao J., Gao Y.: New constructions of large cyclic subspace codes via Sidon spaces. Adv. Math. Commun. 18(4), 1123\u20131137 (2024).","journal-title":"Adv. Math. Commun."},{"issue":"5","key":"1770_CR23","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":"4457","key":"1770_CR24","first-page":"114007","volume":"13","author":"Y Niu","year":"2024","unstructured":"Niu Y., Li Y.: Several constructions of cyclic subspace codes utilizing $$(k+1)-$$dimensional Sidon spaces. Electronics 13(4457), 114007 (2024).","journal-title":"Electronics"},{"key":"1770_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/s12095-025-00794-7","author":"Y Niu","year":"2025","unstructured":"Niu Y., Li Y., Li F., Wu L.: Several new kinds of $$(k+1)-$$dimensional Sidon spaces and cyclic subspace codes. Cryptogr. Commun. (2025). https:\/\/doi.org\/10.1007\/s12095-025-00794-7.","journal-title":"Cryptogr. Commun."},{"issue":"2","key":"1770_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":"1770_CR27","doi-asserted-by":"crossref","unstructured":"Raviv N., Tamo I.: Multivariate Public Key Cryptosystem from Sidon Spaces. Cryptology ePrint Archive, p. 254 (2021).","DOI":"10.1007\/978-3-030-75245-3_10"},{"issue":"6","key":"1770_CR28","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":"3","key":"1770_CR29","doi-asserted-by":"publisher","first-page":"106842","DOI":"10.1016\/j.jpaa.2021.106842","volume":"226","author":"P Santonastaso","year":"2022","unstructured":"Santonastaso P., Zullo F.: Linearized trinomials with maximum kernel. J. Pure Appl. Algebra 226(3), 106842 (2022).","journal-title":"J. Pure Appl. Algebra"},{"issue":"1","key":"1770_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 Grassmann graph. J. Comb. Theory A 97(1), 27\u201342 (2002).","journal-title":"J. Comb. Theory A"},{"issue":"11","key":"1770_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":"1770_CR32","doi-asserted-by":"publisher","first-page":"3799","DOI":"10.1007\/s10623-024-01466-y","volume":"92","author":"S Yu","year":"2024","unstructured":"Yu S., Ji L.: Two new constructions of cyclic subspace codes via Sidon spaces. Des. Codes Cryptogr. 92, 3799\u20133811 (2024).","journal-title":"Des. Codes Cryptogr."},{"key":"1770_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":"1770_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":"1770_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":"1770_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."},{"issue":"7","key":"1770_CR37","doi-asserted-by":"publisher","first-page":"114007","DOI":"10.1016\/j.disc.2024.114007","volume":"347","author":"H Zhang","year":"2024","unstructured":"Zhang H., Tang C., Cao X.: Large optimal cyclic subspace codes. Discret. Math. 347(7), 114007 (2024).","journal-title":"Discret. Math."},{"key":"1770_CR38","doi-asserted-by":"publisher","DOI":"10.1007\/s40314-023-02353-3","author":"H Zhang","year":"2023","unstructured":"Zhang H., Tang C., Hu X.: New constructions of Sidon spaces and large cyclic constant dimension codes. Comput. Appl. Math. (2023). https:\/\/doi.org\/10.1007\/s40314-023-02353-3.","journal-title":"Comput. Appl. Math."},{"key":"1770_CR39","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s12095-024-00749-4","volume":"17","author":"H Zhang","year":"2025","unstructured":"Zhang H., Tang C., Hu X.: Three families of large cyclic subspace codes. Cryptogr. Commun. 17, 139\u2013163 (2025).","journal-title":"Cryptogr. Commun."},{"key":"1770_CR40","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. Comb. 55, 781\u2013794 (2022).","journal-title":"J. Algebr. Comb."},{"key":"1770_CR41","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":"1770_CR42","doi-asserted-by":"publisher","first-page":"102153","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."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01770-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-025-01770-1","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01770-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T05:02:34Z","timestamp":1774846954000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-025-01770-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,16]]},"references-count":42,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["1770"],"URL":"https:\/\/doi.org\/10.1007\/s10623-025-01770-1","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,16]]},"assertion":[{"value":"16 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 August 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 September 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 February 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"50"}}