{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T08:06:10Z","timestamp":1779782770545,"version":"3.53.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,3,7]],"date-time":"2025-03-07T00:00:00Z","timestamp":1741305600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,7]],"date-time":"2025-03-07T00:00:00Z","timestamp":1741305600000},"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":["AAECC"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1007\/s00200-025-00681-x","type":"journal-article","created":{"date-parts":[[2025,3,7]],"date-time":"2025-03-07T00:59:31Z","timestamp":1741309171000},"page":"647-660","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Asymptotically good LCD 2-quasi-abelian codes over finite chain rings"],"prefix":"10.1007","volume":"37","author":[{"given":"Sanjit","family":"Bhowmick","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiusheng","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,3,7]]},"reference":[{"key":"681_CR1","doi-asserted-by":"publisher","first-page":"3210","DOI":"10.1109\/TIT.2006.876244","volume":"52","author":"LMJ Bazzi","year":"2006","unstructured":"Bazzi, L.M.J., Mitter, S.K.: Some randomized code constructions from group actions. IEEE Trans. Inform. Theory 52, 3210\u20133219 (2006)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"681_CR2","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1007\/s10623-019-00713-x","volume":"88","author":"S Bhowmick","year":"2020","unstructured":"Bhowmick, S., Tabue, A.F., Martinez-Moro, E., Bandi, R., Bagchi, S.: Do non-free LCD codes over finite commutative Frobenius rings exist? Des., Codes Cryptogr. 88, 825\u2013840 (2020)","journal-title":"Des., Codes Cryptogr."},{"key":"681_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/s13226-024-00563-x","author":"S Bhowmick","year":"2024","unstructured":"Bhowmick, S., Bagchi, S., Bandi, R.: On LCD codes over $$\\mathbb{Z} _4$$. Indian J. Pure Appl. Math (2024). https:\/\/doi.org\/10.1007\/s13226-024-00563-x","journal-title":"Indian J. Pure Appl. Math"},{"issue":"4","key":"681_CR4","doi-asserted-by":"publisher","first-page":"113853","DOI":"10.1016\/j.disc.2023.113853","volume":"347","author":"S Bhowmick","year":"2024","unstructured":"Bhowmick, S., Tabue, A.F., Pal, J.: On the $$\\ell$$-DLIPs of codes over finite commutative rings. Discrete Math. 347(4), 113853 (2024)","journal-title":"Discrete Math."},{"key":"681_CR5","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1109\/18.825811","volume":"46","author":"C Ding","year":"2000","unstructured":"Ding, C., Kohel, D.R.: Split group codes. IEEE Trans. Inform. Theory 46, 485\u2013495 (2000)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"681_CR6","doi-asserted-by":"crossref","unstructured":"Fan, Y., Lin, L.: Self-dual 2-quasi abelian codes. IEEE Trans. Inform. Theory, 68 6417\u20136425, (2022)","DOI":"10.1109\/TIT.2022.3180790"},{"key":"681_CR7","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1109\/18.312154","volume":"40","author":"AR Hammons","year":"1994","unstructured":"Hammons, A.R., Kumar, P.V., Calderbank, A.R., Sloane, N.J.A., Sol\u00e9, P.: The $$\\mathbb{Z} _4$$-linearity of Kerdock, Preparata, Goethals, and related codes. IEEE Trans. Inform. Theory 40, 301\u2013319 (1994)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"681_CR8","first-page":"1","volume":"7","author":"T Honold","year":"2000","unstructured":"Honold, T., Landjev, I.: Linear codes over finite chain rings. Electron. Jo. Combinat. 7, 1\u201322 (2000)","journal-title":"Electron. Jo. Combinat."},{"key":"681_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-67997-1","volume-title":"Finite Groups II","author":"B Huppert","year":"1982","unstructured":"Huppert, B., Blackburn, N.: Finite Groups II. Springer, Berlin (1982)"},{"key":"681_CR10","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/s10623-013-9878-4","volume":"74","author":"S Jitman","year":"2015","unstructured":"Jitman, S., Ling, S.: Quasi-abelian codes. Des. Codes Cryptogr. 74, 511\u2013531 (2015)","journal-title":"Des. Codes Cryptogr."},{"key":"681_CR11","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.: LCD codes over finite chain rings. Finite Fileds Appl. 34, 1\u201319 (2015)","journal-title":"Finite Fileds Appl."},{"key":"681_CR12","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1007\/s10623-019-00706-w","volume":"88","author":"X Liu","year":"2020","unstructured":"Liu, X., Liu, H.: $$\\sigma$$-LCD codes over a finite chain rings. Des. Codes Cryptogr. 88, 727\u2013746 (2020)","journal-title":"Des. Codes Cryptogr."},{"key":"681_CR13","doi-asserted-by":"crossref","unstructured":"Mart\u00ed\u00adnez-P\u00e9rez, C., Mesnager, S., Willems, W.: Self-dual doubly even 2-quasi-cyclic transitive codes are asymptotically good. IEEE Trans. Inform. Theory, 53 4302\u20134308, (2007)","DOI":"10.1109\/TIT.2007.907500"},{"key":"681_CR14","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/0012-365X(92)90563-U","volume":"106\u2013107","author":"JL Massey","year":"1992","unstructured":"Massey, J.L.: Linear codes with complementary duals. Discrete Math. 106\u2013107, 337\u2013342 (1992)","journal-title":"Discrete Math."},{"key":"681_CR15","volume-title":"Finite Rings with Identity","author":"BR McDonald","year":"1974","unstructured":"McDonald, B.R.: Finite Rings with Identity. Marcel Dekker Inc., New York (1974)"},{"key":"681_CR16","unstructured":"Miles, C.P., Sehgal, S.K.: An introduction to Group Rings. Kluwer academic publishers, (2001)"},{"key":"681_CR17","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/PL00012382","volume":"10","author":"GH Norton","year":"2000","unstructured":"Norton, G.H., S\u0103l\u0103gean, A.: On the structure of linear and cyclic codes over finite chain rings. Appl. Algebra Eng. Commun. Comput. 10, 489\u2013506 (2000)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"681_CR18","doi-asserted-by":"publisher","first-page":"41060","DOI":"10.1109\/18.841186","volume":"46","author":"GH Norton","year":"2000","unstructured":"Norton, G.H., S\u0103l\u0103gean, A.: On the structure of linear and cyclic codes over finite chain rings. IEEE Trans. Inform. Theory. 46, 41060\u20131067 (2000)","journal-title":"IEEE Trans. Inform. Theory."},{"key":"681_CR19","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.disc.2004.05.005","volume":"285","author":"N Sendrier","year":"2004","unstructured":"Sendrier, N.: Linear codes with complementary duals meet the Gilbert\u2013Varshamov bound. Discrete Math. 285, 345\u2013347 (2004)","journal-title":"Discrete Math."},{"key":"681_CR20","doi-asserted-by":"crossref","unstructured":"Wan, Z.: Finite Fields and Galois Rings. World Scientific Publishing Co Pte Ltd, (2011)","DOI":"10.1142\/8250"},{"key":"681_CR21","first-page":"1","volume":"78","author":"G Zhang","year":"2022","unstructured":"Zhang, G., Chen, B.: Self-orthogonal quasi-abelian codes are asymptotically good, Finite Fields and Their Applications. Finite Fileds Appl. 78, 1\u201317 (2022)","journal-title":"Finite Fileds Appl."},{"key":"681_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2024.114224","author":"G Zhang","year":"2024","unstructured":"Zhang, G., Lin, L., Liu, X.: Asymptotically good LCD $$2$$-quasi-abelian codes over finite fields. Discrete Math. (2024). https:\/\/doi.org\/10.1016\/j.disc.2024.114224","journal-title":"Discrete Math."}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-025-00681-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00200-025-00681-x","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-025-00681-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T07:46:25Z","timestamp":1779781585000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00200-025-00681-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,7]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,5]]}},"alternative-id":["681"],"URL":"https:\/\/doi.org\/10.1007\/s00200-025-00681-x","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,7]]},"assertion":[{"value":"13 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 March 2025","order":3,"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 known Conflict of interest or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}