{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T07:51:23Z","timestamp":1772265083331,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T00:00:00Z","timestamp":1769040000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T00:00:00Z","timestamp":1769040000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100009448","name":"Universit\u00e0 degli Studi della Campania Luigi Vanvitelli","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100009448","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2026,2]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    We focus on two aspects of cyclic orbit codes: invariants under equivalence and quasi-optimality. Regarding the first aspect, we establish a connection between the cyclic orbit code generated by a subspace\u00a0\n                    <jats:italic>U<\/jats:italic>\n                    of\u00a0\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$${{\\mathbb {F}}}_{q^n}$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:msub>\n                            <mml:mi>F<\/mml:mi>\n                            <mml:msup>\n                              <mml:mi>q<\/mml:mi>\n                              <mml:mi>n<\/mml:mi>\n                            <\/mml:msup>\n                          <\/mml:msub>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    and the associated linear set\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$L_{U\\times U}$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:msub>\n                            <mml:mi>L<\/mml:mi>\n                            <mml:mrow>\n                              <mml:mi>U<\/mml:mi>\n                              <mml:mo>\u00d7<\/mml:mo>\n                              <mml:mi>U<\/mml:mi>\n                            <\/mml:mrow>\n                          <\/mml:msub>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    . Relating the size of the linear set to the number of fractions formed by the elements of\u00a0\n                    <jats:italic>U<\/jats:italic>\n                    allows us to derive new bounds on the parameters of the cyclic orbit code. In the second part, we study a particular family of (quasi-)optimal cyclic orbit codes. With the aid of these codes we establish the existence of quasi-optimal codes in even-dimensional vector spaces over finite fields of any characteristic. Finally, for the particular code family we determine the automorphism groups in various general linear group, depending on the assumed ground field, and their orbits under the Galois group over the prime field.\n                  <\/jats:p>","DOI":"10.1007\/s10623-025-01751-4","type":"journal-article","created":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T15:59:06Z","timestamp":1769097546000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Quasi-optimal cyclic orbit codes"],"prefix":"10.1007","volume":"94","author":[{"given":"Chiara","family":"Castello","sequence":"first","affiliation":[]},{"given":"Heide","family":"Gluesing-Luerssen","sequence":"additional","affiliation":[]},{"given":"Olga","family":"Polverino","sequence":"additional","affiliation":[]},{"given":"Ferdinando","family":"Zullo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,22]]},"reference":[{"issue":"4","key":"1751_CR1","doi-asserted-by":"publisher","first-page":"1204","DOI":"10.1109\/18.850663","volume":"46","author":"R Ahlswede","year":"2000","unstructured":"Ahlswede R., Cai N., Li S.Y., Yeung R.W.: Network information flow. IEEE Trans. Inf. Theory 46(4), 1204\u20131216 (2000).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"1751_CR2","doi-asserted-by":"publisher","first-page":"1950","DOI":"10.1109\/SURV.2013.013013.00104","volume":"15","author":"R Bassoli","year":"2013","unstructured":"Bassoli R., Marques H., Rodriguez J., Shum K.W., Tafazolli R.: Network coding theory: a survey. IEEE Commun. Surv. Tutor. 15(4), 1950\u20131978 (2013).","journal-title":"IEEE Commun. Surv. Tutor."},{"issue":"3","key":"1751_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":"1751_CR4","unstructured":"Bhaintwal M.: On the distance distributions of single-orbit cyclic subspace codes (2024). arXiv:2407.02200."},{"key":"1751_CR5","first-page":"35","volume":"2","author":"G Bonoli","year":"2005","unstructured":"Bonoli G., Polverino O.: $$\\mathbb{F} _q$$-linear blocking sets in $$\\rm PG (2, q^4)$$. Innov. Incid. Geom. 2, 35\u201356 (2005).","journal-title":"Innov. Incid. Geom."},{"issue":"4","key":"1751_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(4), 1299\u20131329 (2023).","journal-title":"J. Algebr. Comb."},{"key":"1751_CR7","doi-asserted-by":"crossref","unstructured":"Castello C., Polverino O., Zullo F.: On one-orbit cyclic subspace codes of $$G_q (n, 3)$$. In: 2024 IEEE International Symposium on Information Theory (ISIT) (2024).","DOI":"10.1109\/ISIT57864.2024.10619570"},{"key":"1751_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2024.106005","volume":"212","author":"C Castello","year":"2025","unstructured":"Castello C., Polverino O., Zullo F.: Full weight spectrum one-orbit cyclic subspace codes. J. Comb. Theory Ser. A 212, 106005 (2025). https:\/\/doi.org\/10.1016\/j.jcta.2024.106005.","journal-title":"J. Comb. Theory Ser. A"},{"issue":"1\u20133","key":"1751_CR9","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1023\/B:DESI.0000029214.50635.17","volume":"32","author":"A Cossidente","year":"2004","unstructured":"Cossidente A., Resmini M.D.: Remarks on Singer cyclic groups and their normalizers. Des. Codes Cryptogr. 32(1\u20133), 97\u2013102 (2004).","journal-title":"Des. Codes Cryptogr."},{"issue":"11","key":"1751_CR10","doi-asserted-by":"publisher","first-page":"3300","DOI":"10.1112\/blms.13133","volume":"56","author":"B Csajb\u00f3k","year":"2024","unstructured":"Csajb\u00f3k B., Marino G., Pepe V.: On the maximum field of linearity of linear sets. Bull. Lond. Math. Soc. 56(11), 3300\u20133315 (2024).","journal-title":"Bull. Lond. Math. Soc."},{"key":"1751_CR11","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.jcta.2018.12.008","volume":"164","author":"J De Beule","year":"2019","unstructured":"De Beule J., Van de Voorde G.: The minimum size of a linear set. J. Comb. Theory Ser. A 164, 109\u2013124 (2019).","journal-title":"J. Comb. Theory Ser. A"},{"issue":"2","key":"1751_CR12","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"},{"key":"1751_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."},{"key":"1751_CR14","doi-asserted-by":"publisher","first-page":"119","DOI":"10.3934\/amc.2021040","volume":"17","author":"H Gluesing-Luerssen","year":"2023","unstructured":"Gluesing-Luerssen H., Lehmann H.: Automorphism groups and isometries for cyclic orbit codes. Adv. Math. Commun. 17, 119\u2013138 (2023).","journal-title":"Adv. Math. Commun."},{"issue":"2","key":"1751_CR15","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":"1751_CR16","doi-asserted-by":"crossref","unstructured":"Gorla E., Manganiello F., Rosenthal J.: Spread codes and spread decoding in network coding. In: 2008 IEEE International Symposium on Information Theory, pp. 881\u2013885 (2008).","DOI":"10.1109\/ISIT.2008.4595113"},{"key":"1751_CR17","doi-asserted-by":"publisher","first-page":"2212","DOI":"10.1016\/j.laa.2008.11.021","volume":"430","author":"R Gow","year":"2009","unstructured":"Gow R., Quinlan R.: Galois extensions and subspaces of alternating bilinear forms with special rank properties. Linear Algebra Appl. 430, 2212\u20132224 (2009).","journal-title":"Linear Algebra Appl."},{"key":"1751_CR18","doi-asserted-by":"publisher","first-page":"1778","DOI":"10.1016\/j.laa.2008.06.030","volume":"430","author":"R Gow","year":"2009","unstructured":"Gow R., Quinlan R.: Galois theory and linear algebra. Linear Algebra Appl. 430, 1778\u20131789 (2009).","journal-title":"Linear Algebra Appl."},{"key":"1751_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70293-3","volume-title":"Network Coding and Subspace Designs","author":"M Greferath","year":"2018","unstructured":"Greferath M., Pav\u010devi\u0107 M.O., Silberstein N., V\u00e1zquez-Castro M.\u00c1.: Network Coding and Subspace Designs. Springer, New York (2018)."},{"issue":"3","key":"1751_CR20","doi-asserted-by":"publisher","first-page":"492","DOI":"10.4153\/CJM-1970-057-2","volume":"22","author":"MD Hestenes","year":"1970","unstructured":"Hestenes M.D.: Singer groups. Can. J. Math. 22(3), 492\u2013513 (1970).","journal-title":"Can. J. Math."},{"key":"1751_CR21","doi-asserted-by":"publisher","first-page":"3579","DOI":"10.1109\/TIT.2008.926449","volume":"54","author":"R Koetter","year":"2008","unstructured":"Koetter R., Kschischang F.R.: Coding for errors and erasures in random network coding. IEEE Trans. Inf. Theory 54, 3579\u20133591 (2008).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1751_CR22","doi-asserted-by":"crossref","unstructured":"Lavrauw M., Van de Voorde G.: Field reduction and linear sets in finite geometry. In: Topics in Finite Fields, AMS Contemporary Mathematics, vol. 623, pp. 271\u2013293. American Mathematical Society, Providence (2015).","DOI":"10.1090\/conm\/632\/12633"},{"issue":"2","key":"1751_CR23","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":"22","key":"1751_CR24","doi-asserted-by":"publisher","first-page":"3096","DOI":"10.1016\/j.disc.2009.04.007","volume":"310","author":"O Polverino","year":"2010","unstructured":"Polverino O.: Linear sets in finite projective spaces. Discret. Math. 310(22), 3096\u20133107 (2010).","journal-title":"Discret. Math."},{"issue":"6","key":"1751_CR25","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":"1751_CR26","doi-asserted-by":"publisher","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":"1751_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02410047","volume":"64","author":"B Segre","year":"1964","unstructured":"Segre B.: Teoria di Galois, fibrazioni proiettive e geometrie non desarguesiane. Ann. Mat. 64(1), 1\u201376 (1964).","journal-title":"Ann. Mat."},{"issue":"3","key":"1751_CR28","doi-asserted-by":"publisher","first-page":"475","DOI":"10.3934\/amc.2016019","volume":"10","author":"J Sheekey","year":"2016","unstructured":"Sheekey J.: A new family of linear maximum rank distance codes. Adv. Math. Commun. 10(3), 475\u2013488 (2016).","journal-title":"Adv. Math. Commun."},{"key":"1751_CR29","doi-asserted-by":"publisher","first-page":"147","DOI":"10.3934\/amc.2013.7.147","volume":"7","author":"A-L Trautmann","year":"2013","unstructured":"Trautmann A.-L.: Isometry and automorphisms of constant dimension codes. Adv. Math. Commun. 7, 147\u2013160 (2013).","journal-title":"Adv. Math. Commun."},{"issue":"11","key":"1751_CR30","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":"1751_CR31","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."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01751-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-025-01751-4","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01751-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T04:49:42Z","timestamp":1772254182000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-025-01751-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,22]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,2]]}},"alternative-id":["1751"],"URL":"https:\/\/doi.org\/10.1007\/s10623-025-01751-4","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,22]]},"assertion":[{"value":"5 January 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 September 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 November 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 January 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":"33"}}