{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T20:25:10Z","timestamp":1778099110273,"version":"3.51.4"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,10,7]],"date-time":"2022-10-07T00:00:00Z","timestamp":1665100800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,7]],"date-time":"2022-10-07T00:00:00Z","timestamp":1665100800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Research Funds of Hubei Province","award":["D20144401"],"award-info":[{"award-number":["D20144401"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s10623-022-01120-5","type":"journal-article","created":{"date-parts":[[2022,10,7]],"date-time":"2022-10-07T12:04:37Z","timestamp":1665144277000},"page":"695-708","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["LCP of group codes over finite Frobenius rings"],"prefix":"10.1007","volume":"91","author":[{"given":"Xiusheng","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hualu","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,7]]},"reference":[{"issue":"5","key":"1120_CR1","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., Mart\u00ednez-Moro E., Bandi R., Bagchi S.: Do non-free LCD codes over finite commutative Frobenius rings exist? Des. Codes Cryptogr. 88(5), 825\u2013840 (2020).","journal-title":"Des. Codes Cryptogr."},{"key":"1120_CR2","doi-asserted-by":"publisher","first-page":"111905","DOI":"10.1016\/j.disc.2020.111905","volume":"343","author":"M Borello","year":"2020","unstructured":"Borello M., de Cruz J., Willems W.: A note on linear complementary pairs of group codes. Discret. Math. 343, 111905 (2020).","journal-title":"Discret. Math."},{"key":"1120_CR3","doi-asserted-by":"crossref","unstructured":"Carlet C., G\u00fcneri C., Mesnager S., \u00d6zbudak F.: Construction of some codes suitable for both side channel and fault injection attacks. In: Proceedings of International Workshop on the Arithmetic of Finite Fields (WAIFI 2018), Bergen (2018).","DOI":"10.1007\/978-3-030-05153-2_5"},{"issue":"1","key":"1120_CR4","doi-asserted-by":"publisher","first-page":"6583","DOI":"10.1109\/TIT.2018.2796125","volume":"64","author":"C Carlet","year":"2018","unstructured":"Carlet C., G\u00fcneri C., \u00d6zbudak F., \u00d6zkaya B., Sol\u00e8 P.: On linear complementary pairs of codes. IEEE Trans. Inf. Theory 64(1), 6583\u20136588 (2018).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1120_CR5","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10623-008-9243-1","volume":"51","author":"ST Dougherty","year":"2009","unstructured":"Dougherty S.T., Liu H.: Independence of vectors in codes over rings. Des. Codes Cryptogr. 51, 55\u201368 (2009).","journal-title":"Des. Codes Cryptogr."},{"key":"1120_CR6","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s10623-008-9215-5","volume":"50","author":"ST Dougherty","year":"2009","unstructured":"Dougherty S.T., Kim J.L., Kulosman H.: MDS codes over finite principal ideal rings. Des. Codes Cryptogr. 50, 77\u201392 (2009).","journal-title":"Des. Codes Cryptogr."},{"key":"1120_CR7","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.: Matrix product codes over finite commutative Frobenius rings. Des. Codes Cryptogr. 71, 201\u2013227 (2014).","journal-title":"Des. Codes Cryptogr."},{"key":"1120_CR8","doi-asserted-by":"publisher","unstructured":"G\u00fcneri C., Mart\u0131nez-Moro E., Say\u0131c\u0131 S.: Linear complementary pair of group codes over finite chain rings. Des. Codes Cryptogr. https:\/\/doi.org\/10.1007\/s10623-020-00792-1","DOI":"10.1007\/s10623-020-00792-1"},{"key":"1120_CR9","doi-asserted-by":"publisher","first-page":"2404","DOI":"10.1109\/LCOMM.2018.2872046","volume":"22","author":"C G\u00fcneri","year":"2018","unstructured":"G\u00fcneri C., \u00d6zkaya B., Say\u0131c\u0131 S.: On linear complementary pair of $$nD$$ cyclic codes. IEEE Commun. Lett. 22, 2404\u20132406 (2018).","journal-title":"IEEE Commun. Lett."},{"key":"1120_CR10","doi-asserted-by":"publisher","first-page":"2495","DOI":"10.1007\/s10623-021-00933-0","volume":"89","author":"P Hu","year":"2021","unstructured":"Hu P., Liu X.S.: Linear complementary pairs of codes over rings. Des. Codes Cryptogr. 89, 2495\u20132509 (2021).","journal-title":"Des. Codes Cryptogr."},{"key":"1120_CR11","doi-asserted-by":"publisher","first-page":"372","DOI":"10.2307\/1970252","volume":"68","author":"I Kaplansky","year":"1958","unstructured":"Kaplansky I.: Projective modules. Ann. Math. 68, 372\u2013377 (1958).","journal-title":"Ann. Math."},{"key":"1120_CR12","doi-asserted-by":"publisher","unstructured":"Liu H., Liu X.S.: LCP of matrix product codes. Linear Multilinear Algebra. https:\/\/doi.org\/10.1080\/03081087.2021.1999889","DOI":"10.1080\/03081087.2021.1999889"},{"key":"1120_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ffa.2015.01.004","volume":"15","author":"XS Liu","year":"2015","unstructured":"Liu X.S., Liu H.: LCD codes over finite chain rings. Finite Field Appl. 15, 1\u201319 (2015).","journal-title":"Finite Field Appl."},{"key":"1120_CR14","volume-title":"Finite Rings with Identity","author":"D McDonald","year":"1974","unstructured":"McDonald D.: Finite Rings with Identity. Marcel Dekker, New York (1974)."},{"key":"1120_CR15","doi-asserted-by":"crossref","unstructured":"Ngo X.T., Bhasin S., Danger J.-L., Guilley S., Najm Z.: Linear complementary dual code improvement to strengthen encoded circuit against hardware Trojan horses. In: Proc. IEEE Int. Symp. Hardw. Oriented Secur. Trust (HOST), pp. 82\u201387 (2015).","DOI":"10.1109\/HST.2015.7140242"},{"key":"1120_CR16","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/PL00012382","volume":"10","author":"GH Norton","year":"2000","unstructured":"Norton G.H., S\u01cel\u01cegean A.S.: On the structure of linear and cyclic codes over a finite chain ring. Appl. Algebra Eng. Commun. Comput. 10, 489\u2013506 (2000).","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"1120_CR17","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1353\/ajm.1999.0024","volume":"121","author":"J Wood","year":"1999","unstructured":"Wood J.: Duality for modules over finite rings and applications to coding theory. Am. J. Math. 121, 555\u2013575 (1999).","journal-title":"Am. J. Math."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01120-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01120-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01120-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,10]],"date-time":"2023-03-10T18:18:23Z","timestamp":1678472303000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01120-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,7]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["1120"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01120-5","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,7]]},"assertion":[{"value":"14 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 May 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 September 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 October 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}