{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T00:31:19Z","timestamp":1760488279765,"version":"build-2065373602"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s40314-025-03310-y","type":"journal-article","created":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T07:01:51Z","timestamp":1754031711000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["LCD codes over Galois rings"],"prefix":"10.1007","volume":"44","author":[{"given":"F.","family":"Rebaine","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1482-7565","authenticated-orcid":false,"given":"K.","family":"Guenda","sequence":"additional","affiliation":[]},{"given":"T. A.","family":"Gulliver","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,1]]},"reference":[{"key":"3310_CR1","unstructured":"Abrahamsson B (2004) Architectures for multiplication in Galois rings. Ph.D Thesis, Link\u00f6ping University, Link\u00f6ping, Sweden"},{"issue":"8","key":"3310_CR2","doi-asserted-by":"publisher","first-page":"1807","DOI":"10.1007\/s10623-017-0425-6","volume":"86","author":"D Augot","year":"2018","unstructured":"Augot D, Loidreau P, Robert G (2018) Generalized Gabidulin codes over fields of any characteristic. Des Codes Cryptogr 86(8):1807\u20131848","journal-title":"Des Codes Cryptogr"},{"issue":"1","key":"3310_CR3","first-page":"1","volume":"17","author":"D Bagio","year":"2025","unstructured":"Bagio D, Dias I, Paques A (2025) On self-dual normal bases. Indagationes Mathematicae New Ser 17(1):1\u201311","journal-title":"Indagationes Mathematicae New Ser"},{"issue":"11","key":"3310_CR4","doi-asserted-by":"publisher","first-page":"3016","DOI":"10.1109\/TIT.2003.819322","volume":"49","author":"TP Berger","year":"2003","unstructured":"Berger TP (2003) Isometries for rank distance and permutation group of Gabidulin codes. IEEE Trans Inf Theory 49(11):3016\u20133019","journal-title":"IEEE Trans Inf Theory"},{"key":"3310_CR5","unstructured":"Berger TP, Ourivski AV (2009) Construction of new MDS codes from Gabidulin codes. In: Proc. workshop on algebraic and combinatorial coding theory, Kranevo, Bulgaria, pp 40\u201347"},{"issue":"5","key":"3310_CR6","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1007\/s10623-019-00713-x","volume":"88","author":"S Bhowmick","year":"2020","unstructured":"Bhowmick S, Fotue-Tabue A, Martinez-Moro E, Bandi R, Bagchi S (2020) Do non-free LCD codes over finite commutative Frobenius rings exist? Des Codes Cryptogr 88(5):825\u2013840","journal-title":"Des Codes Cryptogr"},{"issue":"5","key":"3310_CR7","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.1007\/s12095-022-00568-5","volume":"14","author":"RL Bouzara","year":"2022","unstructured":"Bouzara RL, Guenda K, Martinez-Moro E (2022) Lifted codes and lattices from codes over finite chain rings. Cryptogr Commun 14(5):1009\u20131020","journal-title":"Cryptogr Commun"},{"issue":"1","key":"3310_CR8","doi-asserted-by":"publisher","first-page":"131","DOI":"10.3934\/amc.2016.10.131","volume":"10","author":"C Carlet","year":"2016","unstructured":"Carlet C, Guilley S (2016) Complementary dual codes for counter-measures to side-channel attacks. Adv Math Commun 10(1):131\u2013150","journal-title":"Adv Math Commun"},{"issue":"3","key":"3310_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/s40314-025-03082-5","volume":"44","author":"K Chatouh","year":"2025","unstructured":"Chatouh K, Mokhtari D, Guenda K (2025) Application of multi-secret sharing schemes using LCD codes over $$\\Re =\\cal{R} [w]$$. Comput Appl Math 44(3):123","journal-title":"Comput Appl Math"},{"issue":"3","key":"3310_CR10","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/0097-3165(78)90015-8","volume":"25","author":"P Delsarte","year":"1978","unstructured":"Delsarte P (1978) Bilinear forms over a finite field, with applications to coding theory. J Comb Theory Ser A 25(3):226\u2013241","journal-title":"J Comb Theory Ser A"},{"issue":"2\/3","key":"3310_CR11","first-page":"116","volume":"4","author":"ST Dougherty","year":"2017","unstructured":"Dougherty ST, Kim JL, Ozkaya B, Sok L, Sol\u00e9 P (2017) The combinatorics of LCD codes: linear programming bound and orthogonal matrices. Int J Inf Coding Theory 4(2\/3):116\u2013128","journal-title":"Int J Inf Coding Theory"},{"issue":"2","key":"3310_CR12","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10623-012-9726-y","volume":"71","author":"Y Fan","year":"2014","unstructured":"Fan Y, Ling S, Liu H (2014) Matrix product codes over finite commutative Frobenius rings. Des Codes Cryptogr 71(2):201\u2013227","journal-title":"Des Codes Cryptogr"},{"issue":"11","key":"3310_CR13","doi-asserted-by":"publisher","first-page":"7576","DOI":"10.1109\/TIT.2013.2274264","volume":"59","author":"C Feng","year":"2013","unstructured":"Feng C, Silva D, Kschischang FR (2013) An algebraic approach to physical-layer network coding. IEEE Trans Inf Theory 59(11):7576\u20137596","journal-title":"IEEE Trans Inf Theory"},{"issue":"1","key":"3310_CR14","first-page":"1","volume":"21","author":"EM Gabidulin","year":"1985","unstructured":"Gabidulin EM (1985) Theory of codes with maximum rank distance. Probl Inf Transm 21(1):1\u201312","journal-title":"Probl Inf Transm"},{"issue":"4","key":"3310_CR15","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1216\/RMJ-1973-3-4-521","volume":"3","author":"G Ganske","year":"1973","unstructured":"Ganske G, McDonald BR (1973) Finite local rings. Rocky Mt J Math 3(4):521\u2013540","journal-title":"Rocky Mt J Math"},{"issue":"12","key":"3310_CR16","doi-asserted-by":"publisher","first-page":"7718","DOI":"10.1109\/TIT.2019.2933520","volume":"65","author":"HT Kamche","year":"2019","unstructured":"Kamche HT, Mouaha C (2019) Rank-metric codes over finite principal ideal rings and applications. IEEE Trans Inf Theory 65(12):7718\u20137735","journal-title":"IEEE Trans Inf Theory"},{"key":"3310_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ffa.2015.01.004","volume":"34","author":"X Liu","year":"2015","unstructured":"Liu X, Liu H (2015) LCD codes over finite chain rings. Finite Fields Appl 34:1\u201319","journal-title":"Finite Fields Appl"},{"issue":"107","key":"3310_CR18","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/0012-365X(92)90563-U","volume":"106","author":"JL Massey","year":"1992","unstructured":"Massey JL (1992) Linear codes with complementary duals. Discrete Math 106(107):337\u2013342","journal-title":"Discrete Math"},{"key":"3310_CR19","volume-title":"Finite rings with identity","author":"BR McDonald","year":"1974","unstructured":"McDonald BR (1974) Finite rings with identity. Marcel Dekker, New York, NY, USA"},{"key":"3310_CR20","unstructured":"Salturk E, Dougherty ST (2023) Linear complementary dual codes over the p-adic integers. (submitted)"},{"issue":"9","key":"3310_CR21","doi-asserted-by":"publisher","first-page":"1599","DOI":"10.1587\/transfun.E101.A.1599","volume":"E101.A","author":"M Shi","year":"2018","unstructured":"Shi M (2018) On LCD MRD codes. IEICE Trans Fundam Electron Commun Comput Sci E101.A(9):1599\u20131602","journal-title":"IEICE Trans Fundam Electron Commun Comput Sci"},{"issue":"9","key":"3310_CR22","doi-asserted-by":"publisher","first-page":"3951","DOI":"10.1109\/TIT.2008.928291","volume":"54","author":"D Silva","year":"2008","unstructured":"Silva D, Kschischang FR, Kotter R (2008) A rank-metric approach to error control in random network coding. IEEE Trans Inf Theory 54(9):3951\u20133967","journal-title":"IEEE Trans Inf Theory"},{"key":"3310_CR23","doi-asserted-by":"publisher","first-page":"206","DOI":"10.24330\/ieja.768265","volume":"28","author":"VP Sison","year":"2020","unstructured":"Sison VP (2020) Bases and autmorphism matrix of the Galois ring $$GR(p^{r}, m)$$ over the integer ring $$\\mathbb{Z} _{p^{r}}$$. Int Electron J Algebra 28:206\u2013219","journal-title":"Int Electron J Algebra"},{"issue":"12","key":"3310_CR24","first-page":"19","volume":"50","author":"V Tarokh","year":"1998","unstructured":"Tarokh V, Seshadri N, Calderbank AR (1998) Space-time codes for high data rate wireless communication: performance criterion and code construction. IEEE Trans Inf Theory 50(12):19\u201332","journal-title":"IEEE Trans Inf Theory"},{"key":"3310_CR25","volume-title":"Finite fields and Galois rings","author":"Z-X Wan","year":"2012","unstructured":"Wan Z-X (2012) Finite fields and Galois rings. World Scientific, Hackensack, NJ, USA"},{"key":"3310_CR26","doi-asserted-by":"publisher","unstructured":"Zoubir N, Guenda K, Seneviratne P, Gulliver TA (2024) LCD codes over finite fields. Discrete Math Algorithms Appl 17(05):2450070 (2025). https:\/\/doi.org\/10.1142\/S1793830924500708","DOI":"10.1142\/S1793830924500708"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03310-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-025-03310-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03310-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:13:01Z","timestamp":1760440381000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-025-03310-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,1]]},"references-count":26,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["3310"],"URL":"https:\/\/doi.org\/10.1007\/s40314-025-03310-y","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"type":"print","value":"2238-3603"},{"type":"electronic","value":"1807-0302"}],"subject":[],"published":{"date-parts":[[2025,8,1]]},"assertion":[{"value":"17 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 March 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 June 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 August 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, that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"382"}}