{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T06:51:24Z","timestamp":1762325484562},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,12,3]],"date-time":"2022-12-03T00:00:00Z","timestamp":1670025600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,3]],"date-time":"2022-12-03T00:00:00Z","timestamp":1670025600000},"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":["Cryptogr. Commun."],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s12095-022-00616-0","type":"journal-article","created":{"date-parts":[[2022,12,3]],"date-time":"2022-12-03T08:03:32Z","timestamp":1670054612000},"page":"529-551","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Self-dual and LCD double circulant and double negacirculant codes over a family of finite rings $ \\mathbb {F}_{q}[v_{1}, v_{2},\\dots ,v_{t}]$"],"prefix":"10.1007","volume":"15","author":[{"given":"Hai Q.","family":"Dinh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bhanu Pratap","family":"Yadav","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tushar","family":"Bag","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Panario","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ashish Kumar","family":"Upadhyay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,3]]},"reference":[{"key":"616_CR1","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.dam.2017.01.018","volume":"222","author":"A Alahmandi","year":"2017","unstructured":"Alahmandi, A., G\u00fcneri, C., \u00d6zdemir, B., Shoaib, H., Sol\u00e9, P.: On self-dual double negacirculant codes. Discret. Appl. Math. 222, 205\u2013212 (2017)","journal-title":"Discret. Appl. Math."},{"key":"616_CR2","doi-asserted-by":"publisher","first-page":"1257","DOI":"10.1007\/s10623-017-0393-x","volume":"86","author":"A Alahmadi","year":"2018","unstructured":"Alahmadi, A., \u00d6zdemir, F., Sol\u00e9, P.: On self-dual double circulant codes. Des. Codes, Cryptogr. 86, 1257\u20131265 (2018)","journal-title":"Des. Codes, Cryptogr."},{"key":"616_CR3","first-page":"141","volume":"5","author":"M Askali","year":"2013","unstructured":"Askali, M., Nouh, S., Azouaout, A., Belkasmi, M.: Discovery of good double and tripal circulant codes using multiple impulse. Adv. Comput. Math. 5, 141\u2013148 (2013)","journal-title":"Adv. Comput. Math."},{"key":"616_CR4","unstructured":"Assmus, E.F., Mattson, H.F., Turyn, R.: Cyclic codes. AF Camb. Res. Labs Bedford, 66\u2013348 (1966)"},{"key":"616_CR5","unstructured":"Bosma, W., Cannon, J., Fieker, C., Steel, A. (eds.): Handbook of Magma functions, Edition 2.19 (2013)"},{"key":"616_CR6","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, 131\u2013150 (2016)","journal-title":"Adv. Math. Commun"},{"issue":"3","key":"616_CR7","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/s10623-012-9787-y","volume":"72","author":"Y Cengellenmis","year":"2014","unstructured":"Cengellenmis, Y., Dertli, A., Dougherty, S.: Codes over an infinite family of rings with a Gray map. Des. Codes Crypt. 72(3), 559\u2013580 (2014)","journal-title":"Des. Codes Crypt."},{"key":"616_CR8","unstructured":"Cengellenmis, Y., Dougherty, S.: Cyclic codes over Ak. In: Proceedings of ACCT, Pomorie, Bulgaria (2012)"},{"key":"616_CR9","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/S0019-9958(69)90497-5","volume":"15","author":"CL Chen","year":"1969","unstructured":"Chen, C.L., Peterson, W.W., Weldon, E.J.: Some results on quasi-cyclic codes. Inf. Control 15, 407\u2013423 (1969)","journal-title":"Inf. Control"},{"key":"616_CR10","doi-asserted-by":"publisher","unstructured":"Cheng, X., Cao, X., Qian, L.: Linear complementary dual codes and double circulant codes over a semi-local ring. Adv. Math. Commun, 1\u201312. https:\/\/doi.org\/10.3934\/amc.2022055 (2022)","DOI":"10.3934\/amc.2022055"},{"key":"616_CR11","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory","author":"TM Cover","year":"1991","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley, New York (1991)"},{"key":"616_CR12","doi-asserted-by":"publisher","first-page":"194082","DOI":"10.1109\/ACCESS.2020.3033326","volume":"8","author":"HQ Dinh","year":"2020","unstructured":"Dinh, H.Q., Bag, T., Pathak, S., Upadhyay, A.K., Chinnakum, W.: Quantum codes obtained from constacyclic codes over a family of finite ring $\\mathbb {F}_{p}[u_{1}, u_{2}, \\dots , u_{s}]$. IEEE Access 8, 194082\u2013194091 (2020)","journal-title":"IEEE Access"},{"issue":"3","key":"616_CR13","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.ffa.2010.11.002","volume":"17","author":"S Dougherty","year":"2011","unstructured":"Dougherty, S., Yildiz, B., Karadeniz, S.: Codes over Rk, Gray maps and their binary images. Finite Fields Appl. 17(3), 205\u2013219 (2011)","journal-title":"Finite Fields Appl."},{"key":"616_CR14","unstructured":"Grassl, M.: Bounds on the minimum distance of linear codes and quantum codes. Online available at http:\/\/www.codetables.de"},{"key":"616_CR15","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.ffa.2016.07.005","volume":"42","author":"C G\u00fcneri","year":"2016","unstructured":"G\u00fcneri, C., \u00d6zkaya, B., Sol\u00e9, P.: Quasi-cyclic complementary dual codes. Finite Fields Their Appl. 42, 67\u201380 (2016)","journal-title":"Finite Fields Their Appl."},{"key":"616_CR16","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1109\/18.312154","volume":"40","author":"A Hammons","year":"1994","unstructured":"Hammons, A., 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. Inf. Theory 40, 301\u2013319 (1994)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"616_CR17","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1142\/S0129054119500114","volume":"30","author":"D Huang","year":"2019","unstructured":"Huang, D., Shi, M., Sol\u00e9, P.: Double circulant self-dual and LCD, codes over $\\mathbb {Z}_{p^{2}}$. Int. J. Found. Comput. 30, 407\u2013416 (2019)","journal-title":"Int. J. Found. Comput."},{"key":"616_CR18","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)"},{"key":"616_CR19","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1007\/s12190-018-1165-0","volume":"58","author":"D Suprijanto","year":"2018","unstructured":"Irwansyah, Suprijanto, D.: Structure of linear codes over the ring Bk. J. Appl. Math. Comput. 58, 755\u2013775 (2018)","journal-title":"J. Appl. Math. Comput."},{"key":"616_CR20","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s12190-017-1095-2","volume":"58","author":"A Barra","year":"2018","unstructured":"Irwansyah, Barra, A., Alamsyah, I.M., Muchlis, A., Suprijanto, D.: Skew-cyclic codes over Bk. J. Appl. Math. Comput. 58, 69\u201384 (2018)","journal-title":"J. Appl. Math. Comput."},{"issue":"5","key":"616_CR21","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1109\/TIT.1974.1055262","volume":"20","author":"T Kasami","year":"1974","unstructured":"Kasami, T.: A Gilbert-Varshamov bound for quasi-cyclic codes of rate $\\frac {1}{2}$. IEEE Trans. Inf. Theory 20(5), 679\u2013679 (1974)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"616_CR22","volume-title":"Finite Fields","author":"R Lidl","year":"1997","unstructured":"Lidl, R., Niederreiter, H.: Finite Fields, 2nd edn. Cambridge University Press, Cambridge (1997)","edition":"2nd edn."},{"key":"616_CR23","doi-asserted-by":"publisher","first-page":"2751","DOI":"10.1109\/18.959257","volume":"47","author":"S Ling","year":"2001","unstructured":"Ling, S., Sol\u00e9, P.: On the algebraic structure of quasi-cyclic codes I: Finite Fields. IEEE Trans. Inf. Theory 47, 2751\u20132760 (2001)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"616_CR24","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1023\/A:1024715527805","volume":"30","author":"S Ling","year":"2003","unstructured":"Ling, S., Sol\u00e9, P.: On the algebraic structure of quasi-cyclic codes II: Chain Rings. Des. Codes, Cryptogr. 30, 113\u2013130 (2003)","journal-title":"Des. Codes, Cryptogr."},{"issue":"7","key":"616_CR25","doi-asserted-by":"publisher","first-page":"4828","DOI":"10.1109\/TIT.2021.3056716","volume":"67","author":"S Mesnager","year":"2021","unstructured":"Mesnager, S., Tang, C.: Fast algebraic immunity of Boolean functions and LCD codes. IEEE Trans. Inf. Theory 67(7), 4828\u20134837 (2021)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"616_CR26","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1109\/TIT.2005.862123","volume":"52","author":"C Martinez-Perez","year":"2006","unstructured":"Martinez-Perez, C., Willems, W.: Is the class of cyclic codes asymptotically good. IEEE Trans. Inf. Theory 52, 696\u2013700 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"616_CR27","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.1109\/18.57218","volume":"36","author":"RM Roth","year":"1990","unstructured":"Roth, R.M., Lempel, A.: Application of circulant matrices to the construction and decoding of linear codes. IEEE Trans. Inf. Theory 36, 1157\u20131163 (1990)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"616_CR28","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.ffa.2019.04.001","volume":"58","author":"M Shi","year":"2019","unstructured":"Shi, M., Huang, D., Sok, L., Sol\u00e9, P.: Double circulant LCD codes over $\\mathbb {Z}_{4}$. Finite Fields Appl. 58, 133\u2013144 (2019)","journal-title":"Finite Fields Appl."},{"key":"616_CR29","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s12095-019-00363-9","volume":"12","author":"M Shi","year":"2020","unstructured":"Shi, M., Zhu, H., Qian, L., Sok, S., Sol\u00e9, P.: On self-dual and LCD double circulant and double negacirculant codes over $\\mathbb {F}_{q} + u \\mathbb {F}_{q}$. Crypogr. Commun. 12, 53\u201370 (2020)","journal-title":"Crypogr. Commun."},{"key":"616_CR30","doi-asserted-by":"publisher","first-page":"1018","DOI":"10.1049\/cje.2019.06.021","volume":"28","author":"Y Ting","year":"2019","unstructured":"Ting, Y., Shixin, Z., Xiaoshan, K.: On self-dual and LCD double circulant codes over a non-chain ring. Chin. J. Electron. 28, 1018\u20131024 (2019)","journal-title":"Chin. J. Electron."},{"key":"616_CR31","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/s12190-021-01499-9","volume":"67","author":"S Yadav","year":"2021","unstructured":"Yadav, S., Islam, H., Prakash, O., Sol\u00e9, P.: Self-dual and LCD double circulant and double negacirculant codes over $\\mathbb {F}_{q} + u \\mathbb {F}_{q} + v \\mathbb {F}_{q}$. J. Appl. Math. Comp. 67, 689\u2013705 (2021)","journal-title":"J. Appl. Math. Comp."}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-022-00616-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-022-00616-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-022-00616-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,29]],"date-time":"2023-03-29T07:08:32Z","timestamp":1680073712000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-022-00616-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,3]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["616"],"URL":"https:\/\/doi.org\/10.1007\/s12095-022-00616-0","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,3]]},"assertion":[{"value":"5 August 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 November 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 December 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"No experiment\/s was carried out on (i) live vertebrates (or higher invertebrates), (ii) humans or (iii) human samples that include an unambiguous statement within the method.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Ethics approval and consent to participate"}},{"value":"We give consent to publish the paper once it is accepted.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Consent for Publication"}},{"value":"The authors declare no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Competing interests"}},{"value":"There is no conflict of interest.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of Interests"}}]}}