{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T22:42:02Z","timestamp":1781476922059,"version":"3.54.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"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"}]},{"name":"Guangzhou Research Collaborative Innovation Projects University","award":["2021GDJC-D07"],"award-info":[{"award-number":["2021GDJC-D07"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2023,7]]},"DOI":"10.1007\/s40314-023-02353-3","type":"journal-article","created":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T10:01:38Z","timestamp":1687687298000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["New constructions of Sidon spaces and large cyclic constant dimension codes"],"prefix":"10.1007","volume":"42","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"}]},{"given":"Xing","family":"Hu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,6,25]]},"reference":[{"issue":"3","key":"2353_CR1","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1023\/A:1008394205999","volume":"22","author":"R Ahlswede","year":"2001","unstructured":"Ahlswede R, Aydinian HK, Khachatrian LH (2001) On perfect codes and related concepts. Des Codes Cryptogr 22(3):221\u2013237","journal-title":"Des Codes Cryptogr"},{"issue":"3","key":"2353_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 (2017) An analogue of Vosper\u2019s theorem for extension fields. Math Proc Camb Philos Soc 163(3):423\u2013452","journal-title":"Math Proc Camb Philos Soc"},{"key":"2353_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Sasson E, Etzion T, Gabizon A, Raviv N (2016) Subspace polynomials and cyclic subspace codes. IEEE Trans. Inf. Theory 62(3):1157\u20131165","DOI":"10.1109\/TIT.2016.2520479"},{"key":"2353_CR4","doi-asserted-by":"publisher","unstructured":"BraunM, Etzion T, Ostergard P et al. (2013) Existence of q-analogs of Steiner systems. https:\/\/doi.org\/10.48550\/arXiv.1304.1462","DOI":"10.48550\/arXiv.1304.1462"},{"key":"2353_CR5","doi-asserted-by":"publisher","unstructured":"Chen B, Liu H (2017) Constructions of cyclic constant dimension codes. Des Codes Cryptogr. https:\/\/doi.org\/10.1007\/s10623-017-0394-9","DOI":"10.1007\/s10623-017-0394-9"},{"key":"2353_CR6","doi-asserted-by":"crossref","unstructured":"Cheng Qi, Gao S, Wan D (2012) Constructing high order elements through subspace polynomials. In: Proceedings of twenty-second annual ACM-SIAM symposium on discrete algorithms, SODA 2011, San Francisco, California, USA","DOI":"10.1137\/1.9781611973099.115"},{"issue":"1","key":"2353_CR7","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1137\/0518015","volume":"18","author":"L Chihara","year":"1987","unstructured":"Chihara L (1987) On the zeros of the Askey\u2013Wilson polynomials, with applications to coding theory. SIAM J Math Anal 18(1):191\u2013207","journal-title":"SIAM J Math Anal"},{"key":"2353_CR8","first-page":"49","volume":"4","author":"P Erd\u00f6s","year":"1981","unstructured":"Erd\u00f6s P (1981) Solved and unsolved problems in combinatorics and combinatorial number theory. Congr Numer 4:49\u201362","journal-title":"Congr Numer"},{"issue":"2","key":"2353_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 (2011) Error-correcting codes in projective space. IEEE Trans Inf Theory 57(2):1165\u20131173","journal-title":"IEEE Trans Inf Theory"},{"issue":"4","key":"2353_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2020.112273","volume":"344","author":"T Feng","year":"2021","unstructured":"Feng T, Wang Y (2021) New constructions of large cyclic subspace codes and Sidon spaces. Discret Math 344(4):112273","journal-title":"Discret Math"},{"key":"2353_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 (2021) Distance distributions of cyclic orbit codes. Des Codes Cryptogr 89:447\u2013470","journal-title":"Des Codes Cryptogr"},{"issue":"2","key":"2353_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 (2015) Cyclic orbit codes and stabilizer subfields. Adv Math Commun 9(2):177\u2013197","journal-title":"Adv Math Commun"},{"key":"2353_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/s12095-022-00590-7","author":"X Hong","year":"2022","unstructured":"Hong X, Cao X (2022) Generalized block inserting for constructing new constant dimension codes. Cryptogr Commun. https:\/\/doi.org\/10.1007\/s12095-022-00590-7","journal-title":"Cryptogr Commun"},{"key":"2353_CR14","doi-asserted-by":"publisher","unstructured":"Kohnert A, Kurz S (2008) Construction of large constant dimension codes with a prescribed minimum distance. Math Methods Comput Sci. https:\/\/doi.org\/10.1007\/978-3-540-89994-5_4","DOI":"10.1007\/978-3-540-89994-5_4"},{"issue":"8","key":"2353_CR15","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 FR (2008) Coding for errors and erasures in random network coding. IEEE Trans Inf Theory 54(8):3579\u20133591","journal-title":"IEEE Trans Inf Theory"},{"key":"2353_CR16","doi-asserted-by":"publisher","unstructured":"Li Y, Liu H (2023) Cyclic constant dimension subspace codes via the sum of Sidon spaces. Des Codes Cryptogr 91:1193\u20131207. https:\/\/doi.org\/10.1007\/s10623-022-01146-9","DOI":"10.1007\/s10623-022-01146-9"},{"issue":"1","key":"2353_CR17","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BF01390772","volume":"6","author":"WJ Martin","year":"1995","unstructured":"Martin WJ, Zhu XJ (1995) Anticodes for the Grassman and bilinear forms graphs. Des Codes Cryptogr 6(1):73\u201379","journal-title":"Des Codes Cryptogr"},{"issue":"5","key":"2353_CR18","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 (2020) Several kinds of large cyclic subspace codes via Sidon spaces. Discret Math 343(5):111788","journal-title":"Discret Math"},{"key":"2353_CR19","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2022074","author":"M Niu","year":"2022","unstructured":"Niu M, Xiao J, Gao Y (2022) New constructions of large cyclic subspace codes via Sidon spaces. Adv Math Commun. https:\/\/doi.org\/10.3934\/amc.2022074","journal-title":"Adv Math Commun"},{"issue":"2","key":"2353_CR20","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 (2017) Cyclic subspace codes via subspace polynomials. Des Codes Cryptogr 85(2):191\u2013204","journal-title":"Des Codes Cryptogr"},{"key":"2353_CR21","doi-asserted-by":"publisher","unstructured":"Raviv N, Tamo I (2017) Cyclic subspace codes and Sidon spaces. In: 2017 IEEE international symposium on information theory (ISIT), Aachen, Germany, pp 784\u2013788. https:\/\/doi.org\/10.1109\/ISIT.2017.8006635","DOI":"10.1109\/ISIT.2017.8006635"},{"issue":"6","key":"2353_CR22","doi-asserted-by":"publisher","first-page":"4412","DOI":"10.1109\/TIT.2017.2766178","volume":"64","author":"RM Roth","year":"2018","unstructured":"Roth RM, Raviv N, Tamo I (2018) Construction of Sidon spaces with applications to coding. IEEE Trans Inf Theory 64(6):4412\u20134422","journal-title":"IEEE Trans Inf Theory"},{"issue":"1","key":"2353_CR23","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 (2002) Codes and anticodes in the Grassman graph. J Comb Theory A 97(1):27\u201342","journal-title":"J Comb Theory A"},{"issue":"11","key":"2353_CR24","doi-asserted-by":"publisher","first-page":"7386","DOI":"10.1109\/TIT.2013.2274266","volume":"59","author":"AL Trautmann","year":"2013","unstructured":"Trautmann AL, Manganiello F, Braun M, Rosenthal J (2013) Cyclic orbit codes. IEEE Trans Inf Theory 59(11):7386\u20137404","journal-title":"IEEE Trans Inf Theory"},{"key":"2353_CR25","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 (2021) Further constructions of cyclic subspace codes. Cryptogr Commun 13:245\u2013262","journal-title":"Cryptogr Commun"},{"key":"2353_CR26","doi-asserted-by":"publisher","unstructured":"Zhang T, Ge G (2022) New constructions of Sidon spaces. J Algebr Comb 55:781\u2013794. https:\/\/doi.org\/10.1007\/s10801-021-01069-z","DOI":"10.1007\/s10801-021-01069-z"},{"key":"2353_CR27","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 (2019) A characterization of cyclic subspace codes via subspace polynomials. Finite Fields Appl 57:1\u201312","journal-title":"Finite Fields Appl"},{"key":"2353_CR28","doi-asserted-by":"crossref","unstructured":"Zhang H, Tang C (2023a) Constructions of large cyclic constant dimension codes via Sidon spaces. Des Codes Cryptogr 91:29\u201344","DOI":"10.1007\/s10623-022-01095-3"},{"key":"2353_CR29","doi-asserted-by":"crossref","unstructured":"Zhang H, Tang C (2023b) Further constructions of large cyclic subspace codes via Sidon spaces. Linear Algebra Appl 661:106\u2013115","DOI":"10.1016\/j.laa.2022.12.011"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-023-02353-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-023-02353-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-023-02353-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,10]],"date-time":"2023-07-10T09:07:18Z","timestamp":1688980038000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-023-02353-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":29,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["2353"],"URL":"https:\/\/doi.org\/10.1007\/s40314-023-02353-3","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,25]]},"assertion":[{"value":"24 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 May 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 May 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 June 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"In this paper, the authors declare that there is no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"230"}}