{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T06:47:08Z","timestamp":1750661228878,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,4,18]],"date-time":"2023-04-18T00:00:00Z","timestamp":1681776000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,18]],"date-time":"2023-04-18T00:00:00Z","timestamp":1681776000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100005276","name":"National Board for Higher Mathematics","doi-asserted-by":"publisher","award":["02011\/20\/2021\/ NBHM(R.P)\/R &D II\/8775"],"award-info":[{"award-number":["02011\/20\/2021\/ NBHM(R.P)\/R &D II\/8775"]}],"id":[{"id":"10.13039\/501100005276","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1007\/s12190-023-01861-z","type":"journal-article","created":{"date-parts":[[2023,4,18]],"date-time":"2023-04-18T10:04:04Z","timestamp":1681812244000},"page":"2901-2917","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Linear $$\\ell $$-intersection pairs of cyclic and quasi-cyclic codes over a finite field $${\\mathbb {F}}_q$$"],"prefix":"10.1007","volume":"69","author":[{"given":"Md Ajaharul","family":"Hossain","sequence":"first","affiliation":[]},{"given":"Ramakrishna","family":"Bandi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,18]]},"reference":[{"key":"1861_CR1","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/0012-365X(92)90563-U","volume":"106","author":"JL Massey","year":"1992","unstructured":"Massey, J.L.: Linear codes with complementary duals. Discrete Math. 106, 337\u2013342 (1992)","journal-title":"Discrete Math."},{"issue":"1\u20133","key":"1861_CR2","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/0012-365X(94)90283-6","volume":"126","author":"X Yang","year":"1994","unstructured":"Yang, X., Massey, J.L.: The condition for a cyclic code to have a complementary dual. Discrete Math. 126(1\u20133), 391\u2013393 (1994)","journal-title":"Discrete Math."},{"issue":"3","key":"1861_CR3","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/j.ffa.2009.01.002","volume":"15","author":"M Esmaeili","year":"2009","unstructured":"Esmaeili, M., Yari, S.: On complementary-dual quasi-cyclic codes. Finite Fields Appl. 15(3), 375\u2013386 (2009)","journal-title":"Finite Fields Appl."},{"issue":"1","key":"1861_CR4","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.: Complementary dual codes for counter-measures to side-channel attacks. Adv. Math. Commun. 10(1), 131 (2016)","journal-title":"Adv. Math. Commun."},{"issue":"10","key":"1861_CR5","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., Sole, P.: On linear complementary pairs of codes. IEEE Trans. Inf. Theory 64(10), 6583\u20136589 (2018)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"1861_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., Mart\u00ednez-Moro, E., Bandi, R., Bagchi, S.: Do non-free lcd codes over finite commutative Frobenius rings exist? Des. Codes Crypt. 88(5), 825\u2013840 (2020)","journal-title":"Des. Codes Crypt."},{"issue":"4","key":"1861_CR7","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 finite chain rings. Des. Codes Crypt. 88(4), 727\u2013746 (2020)","journal-title":"Des. Codes Crypt."},{"issue":"11","key":"1861_CR8","doi-asserted-by":"publisher","first-page":"2397","DOI":"10.1007\/s10623-020-00792-1","volume":"88","author":"C G\u00fcneri","year":"2020","unstructured":"G\u00fcneri, C., Mart\u00ednez-Moro, E., Say\u0131c\u0131, S.: Linear complementary pair of group codes over finite chain rings. Des. Codes Crypt. 88(11), 2397\u20132405 (2020)","journal-title":"Des. Codes Crypt."},{"issue":"11","key":"1861_CR9","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.: Linear complementary pairs of codes over rings. Des. Codes Crypt. 89(11), 2495\u20132509 (2021)","journal-title":"Des. Codes Crypt."},{"issue":"1","key":"1861_CR10","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s10623-019-00676-z","volume":"88","author":"K Guenda","year":"2020","unstructured":"Guenda, K., Gulliver, T.A., Jitman, S., Thipworawimon, S.: Linear $$\\ell $$-intersection pairs of codes and their applications. Des. Codes Crypt. 88(1), 133\u2013152 (2020)","journal-title":"Des. Codes Crypt."},{"key":"1861_CR11","first-page":"1","volume":"91","author":"X Liu","year":"2022","unstructured":"Liu, X., Liu, H.: LCP of group codes over finite Frobenius rings. Designs Codes Cryptography 91, 1\u201314 (2022)","journal-title":"Designs Codes Cryptography"},{"key":"1861_CR12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077","volume-title":"Fundamentals of Error-Correcting Codes","author":"WC Huffman","year":"2003","unstructured":"Huffman, W.C., Pless, V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003)"},{"issue":"7","key":"1861_CR13","doi-asserted-by":"publisher","first-page":"4344","DOI":"10.1109\/TIT.2017.2672961","volume":"63","author":"C Li","year":"2017","unstructured":"Li, C., Ding, C., Li, S.: LCD cyclic codes over finite fields. IEEE Trans. Inf. Theory 63(7), 4344\u20134356 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1\u20133","key":"1861_CR14","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/0012-365X(94)90283-6","volume":"126","author":"X Yang","year":"1994","unstructured":"Yang, X., Massey, J.L.: The condition for a cyclic code to have a complementary dual. Discrete Math. 126(1\u20133), 391\u2013393 (1994)","journal-title":"Discrete Math."},{"key":"1861_CR15","unstructured":"S\u00e9guin, G., Drolet, G.: The theory of 1-generator quasi-cyclic codes. Preprint (1990)"},{"issue":"8","key":"1861_CR16","doi-asserted-by":"publisher","first-page":"1745","DOI":"10.1109\/TIT.2004.831861","volume":"50","author":"GE S\u00e9guin","year":"2004","unstructured":"S\u00e9guin, G.E.: A class of 1-generator quasi-cyclic codes. IEEE Trans. Inf. Theory 50(8), 1745\u20131753 (2004)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5798","key":"1861_CR17","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1126\/science.1131563","volume":"314","author":"T Brun","year":"2006","unstructured":"Brun, T., Devetak, I., Hsieh, M.-H.: Correcting quantum errors with entanglement. Science (New York, N.Y.) 314(5798), 436\u2013439 (2006). https:\/\/doi.org\/10.1126\/science.1131563","journal-title":"Science (New York, N.Y.)"},{"issue":"6","key":"1861_CR18","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.77.064302","volume":"77","author":"MM Wilde","year":"2008","unstructured":"Wilde, M.M., Brun, T.A.: Optimal entanglement formulas for entanglement-assisted quantum coding. Phys. Rev. A 77(6), 064302 (2008)","journal-title":"Phys. Rev. A"},{"issue":"1","key":"1861_CR19","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s10623-017-0330-z","volume":"86","author":"K Guenda","year":"2018","unstructured":"Guenda, K., Jitman, S., Gulliver, T.A.: Constructions of good entanglement-assisted quantum error correcting codes. Des. Codes Crypt. 86(1), 121\u2013136 (2018)","journal-title":"Des. Codes Crypt."},{"issue":"6","key":"1861_CR20","doi-asserted-by":"publisher","first-page":"3073","DOI":"10.1109\/TIT.2014.2313559","volume":"60","author":"TA Brun","year":"2014","unstructured":"Brun, T.A., Devetak, I., Hsieh, M.-H.: Catalytic quantum error correction. IEEE Trans. Inf. Theory 60(6), 3073\u20133089 (2014)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1861_CR21","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.103.L020601","volume":"103","author":"M Grassl","year":"2021","unstructured":"Grassl, M.: Entanglement-assisted quantum communication beating the quantum singleton bound. Phys. Rev. A 103(2), 020601 (2021)","journal-title":"Phys. Rev. A"},{"issue":"1","key":"1861_CR22","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1109\/TIT.2017.2711601","volume":"64","author":"C-Y Lai","year":"2017","unstructured":"Lai, C.-Y., Ashikhmin, A.: Linear programming bounds for entanglement-assisted quantum error-correcting codes by split weight enumerators. IEEE Trans. Inf. Theory 64(1), 622\u2013639 (2017)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-023-01861-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-023-01861-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-023-01861-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,19]],"date-time":"2023-07-19T19:22:51Z","timestamp":1689794571000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-023-01861-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,18]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["1861"],"URL":"https:\/\/doi.org\/10.1007\/s12190-023-01861-z","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"type":"print","value":"1598-5865"},{"type":"electronic","value":"1865-2085"}],"subject":[],"published":{"date-parts":[[2023,4,18]]},"assertion":[{"value":"9 October 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 March 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 April 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 April 2023","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 have no conflict of interest to declare.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}