{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T15:23:50Z","timestamp":1763997830202,"version":"3.45.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T00:00:00Z","timestamp":1759017600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T00:00:00Z","timestamp":1759017600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-21-CE39-0009","ANR-21-CE39-0009"],"award-info":[{"award-number":["ANR-21-CE39-0009","ANR-21-CE39-0009"]}],"id":[{"id":"10.13039\/501100001665","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":[[2025,12]]},"DOI":"10.1007\/s10623-025-01688-8","type":"journal-article","created":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T08:09:23Z","timestamp":1759046963000},"page":"5487-5516","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Selfdual skew cyclic codes"],"prefix":"10.1007","volume":"93","author":[{"given":"Xavier","family":"Caruso","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabrice","family":"Drain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,9,28]]},"reference":[{"key":"1688_CR1","unstructured":"Artin M.: Algebra. Pearson Education (2011)."},{"key":"1688_CR2","unstructured":"Batoul A., Boucher D., Boulanouar R.: A construction of selfdual skew cyclic and negacyclic codes of length $$n$$ over $$\\mathbb{F} _{p^n}$$. In: WAIFI 2020: Arithmetic of Finite Fields, July 2020, vol. 12542, p. 2020. Lecture Notes in Computer Science. RENNES, France (2020)."},{"issue":"4","key":"1688_CR3","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/s00200-007-0043-z","volume":"18","author":"D Boucher","year":"2006","unstructured":"Boucher D., Geiselmann W., Ulmer F.: Skew-cyclic codes. Appl. Algebra Eng. Commun. Comput. 18(4), 379\u2013389 (2006).","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"1688_CR4","doi-asserted-by":"crossref","unstructured":"Boucher D.: A note on the existence of self-dual skew codes over finite fields. In Codes, cryptology, and information security. In: First international conference, C2SI 2015, Rabat, Morocco, 26\u201328 May 2015. Proceedings\u2014In Honor of Thierry Berger, pp. 228\u2013239. Springer, Cham (2015).","DOI":"10.1007\/978-3-319-18681-8_18"},{"issue":"4","key":"1688_CR5","doi-asserted-by":"publisher","first-page":"765","DOI":"10.3934\/amc.2016040","volume":"10","author":"D Boucher","year":"2016","unstructured":"Boucher D.: Construction and number of selfdual skew codes over $$F_{p^2}$$. Adv. Math. Commun. 10(4), 765\u2013795 (2016).","journal-title":"Adv. Math. Commun."},{"issue":"47\u201361","key":"1688_CR6","first-page":"01","volume":"60","author":"D Boucher","year":"2014","unstructured":"Boucher D., Ulmer F.: Self-dual skew codes and factorization of skew polynomials. J. Symb. Comput. 60(47\u201361), 01 (2014).","journal-title":"J. Symb. Comput."},{"key":"1688_CR7","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1016\/j.jsc.2016.02.016","volume":"79","author":"X Caruso","year":"2017","unstructured":"Caruso X., Le Borgne J.: A new faster algorithm for factoring skew polynomials over finite fields. J. Symb. Comput. 79, 411\u2013443 (2017).","journal-title":"J. Symb. Comput."},{"key":"1688_CR8","doi-asserted-by":"crossref","unstructured":"Grove, L. C.: Classical groups and geometric algebra.In: Graduate Studies in Mathematics, vol. 39, p. 169. American Mathematical Society (AMS) (2001).","DOI":"10.1090\/gsm\/039"},{"key":"1688_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02429-0","volume-title":"Finite-Dimensional Division Algebras over Fields","author":"N Jacobson","year":"1996","unstructured":"Jacobson N.: Finite-Dimensional Division Algebras over Fields. Springer, Berlin (1996)."},{"key":"1688_CR10","volume-title":"Fields and Galois Theory","author":"JS Milne","year":"2020","unstructured":"Milne J.S.: Fields and Galois Theory. Kea Books, Ann Arbor (2020)."},{"key":"1688_CR11","first-page":"418","volume":"39","author":"V Pless","year":"1965","unstructured":"Pless V.: The number of isotropic subspaces in a finite geometry. Atti Accad. Naz. Lincei, VIII. Ser., Rend. Cl. Sci. Fis. Mat. Nat. 39, 418\u2013421 (1965).","journal-title":"Cl. Sci. Fis. Mat. Nat."},{"key":"1688_CR12","first-page":"102","volume":"26","author":"G P\u00f3lya","year":"1971","unstructured":"P\u00f3lya G., Alexanderson G.L.: Gaussian binomial coefficients. Elem. Math. 26, 102\u2013109 (1971).","journal-title":"Elem. Math."},{"key":"1688_CR13","doi-asserted-by":"crossref","unstructured":"Scharlau W.: Quadratic and Hermitian Forms. Grundlehren der mathematischen Wissenschaften. World Publishing Corporation (1985).","DOI":"10.1007\/978-3-642-69971-9"},{"key":"1688_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02410658","volume":"48","author":"B Segre","year":"1959","unstructured":"Segre B.: Le geometrie di galois. Ann. Mat. 48, 1\u201396 (1959).","journal-title":"Ann. Mat."},{"key":"1688_CR15","volume-title":"Foundations of Module and Ring Theory: A Handbook for Study and Research","author":"R Wisbauer","year":"1991","unstructured":"Wisbauer R.: Foundations of Module and Ring Theory: A Handbook for Study and Research, 1st edn Gordon and Breach Science Publishers, Reading (1991).","edition":"1"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01688-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-025-01688-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01688-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T15:18:28Z","timestamp":1763997508000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-025-01688-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,28]]},"references-count":15,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["1688"],"URL":"https:\/\/doi.org\/10.1007\/s10623-025-01688-8","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2025,9,28]]},"assertion":[{"value":"15 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 April 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 June 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 September 2025","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 competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}