{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:45:28Z","timestamp":1775054728919,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2021,9,15]],"date-time":"2021-09-15T00:00:00Z","timestamp":1631664000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,9,15]],"date-time":"2021-09-15T00:00:00Z","timestamp":1631664000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004410","name":"T\u00fcrkiye Bilimsel ve Teknolojik Arastirma KurumuT\u00fcrkiye Bilimsel ve Teknolojik Arastirma Kurumu","doi-asserted-by":"publisher","award":["114F432"],"award-info":[{"award-number":["114F432"]}],"id":[{"id":"10.13039\/501100004410","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001711","name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","doi-asserted-by":"crossref","award":["200021_188430"],"award-info":[{"award-number":["200021_188430"]}],"id":[{"id":"10.13039\/501100001711","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s10623-021-00921-4","type":"journal-article","created":{"date-parts":[[2021,9,15]],"date-time":"2021-09-15T13:03:20Z","timestamp":1631711000000},"page":"2647-2661","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The concatenated structure of quasi-abelian codes"],"prefix":"10.1007","volume":"90","author":[{"given":"Martino","family":"Borello","sequence":"first","affiliation":[]},{"given":"Cem","family":"G\u00fcneri","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0762-4129","authenticated-orcid":false,"given":"Elif","family":"Sa\u00e7\u0131kara","sequence":"additional","affiliation":[]},{"given":"Patrick","family":"Sol\u00e9","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,15]]},"reference":[{"key":"921_CR1","doi-asserted-by":"crossref","unstructured":"Assmus E.F. Jr., Key J.D.: Designs and their codes, vol. 103. Cambridge University Press, Cambridge (1992).","DOI":"10.1017\/CBO9781316529836"},{"issue":"3","key":"921_CR2","first-page":"45","volume":"10","author":"EL Blokh","year":"1974","unstructured":"Blokh E.L., Zyablov V.V.: Coding of generalized concatenated codes. Probl. Peredachi Informatsii 10(3), 45\u201350 (1974).","journal-title":"Probl. Peredachi Informatsii"},{"key":"921_CR3","doi-asserted-by":"crossref","unstructured":"Borello M.: On the automorphism groups of binary linear codes. In: Topics in Finite Fields, Contemporary Mathematics, vol. 632 (2015).","DOI":"10.1090\/conm\/632\/12617"},{"key":"921_CR4","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W Bosma","year":"1997","unstructured":"Bosma W., Cannon J., Playoust C.: The Magma algebra system I: the user language. J. Symb. Comput. 24, 235\u2013265 (1997).","journal-title":"J. Symb. Comput."},{"key":"921_CR5","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."},{"key":"921_CR6","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., Ling S.: Split group codes. IEEE Trans. Inf. Theory 46, 485\u2013495 (2000).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"921_CR7","unstructured":"Dumer I.: Concatenated codes and their multilevel generalizations, Handbook of Coding Theory, pp. 1911\u20131988. North-Holland, Amsterdam (1998)."},{"issue":"1","key":"921_CR8","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1109\/TIT.2014.2368138","volume":"61","author":"Y Fan","year":"2014","unstructured":"Fan Y., Lin L.: Thresholds of random quasi-abelian codes. IEEE Trans. Inf. Theory 61(1), 82\u201390 (2014).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"921_CR9","unstructured":"Grassl M.: Bounds on the minimum distance of linear codes and quantum codes. http:\/\/www.codetables.de. Accessed 3 July 2021."},{"key":"921_CR10","doi-asserted-by":"publisher","first-page":"979","DOI":"10.1109\/TIT.2012.2225823","volume":"59","author":"C G\u00fcneri","year":"2013","unstructured":"G\u00fcneri C., \u00d6zbudak F.: The concatenated structure of quasi-cyclic codes and an improvement of Jensen\u2019s bound. IEEE Trans. Inf. Theory 59, 979\u2013985 (2013).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"921_CR11","doi-asserted-by":"publisher","first-page":"2735","DOI":"10.1016\/j.disc.2018.06.025","volume":"341","author":"C G\u00fcneri","year":"2018","unstructured":"G\u00fcneri C., \u00d6zdemir B., Sol\u00e9 P.: On additive cyclic structure of quasi-cyclic codes. Discret. Math. 341(10), 2735\u20132741 (2018).","journal-title":"Discret. Math."},{"key":"921_CR12","doi-asserted-by":"publisher","first-page":"6772","DOI":"10.1109\/TIT.2016.2616467","volume":"62","author":"C G\u00fcneri","year":"2016","unstructured":"G\u00fcneri C., \u00d6zkaya B.: Multidimensional quasi-cyclic and convolutional codes. IEEE Trans. Inf. Theory 62, 6772\u20136785 (2016).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"921_CR13","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 Appl. 42, 67\u201380 (2016).","journal-title":"Finite Fields Appl."},{"key":"921_CR14","doi-asserted-by":"publisher","first-page":"223","DOI":"10.3934\/amc.2007.1.223","volume":"1","author":"TA Gulliver","year":"2007","unstructured":"Gulliver T.A., Harada M., Miyabayashi H.: Double circulant and quasi-twisted self-dual codes over and $${\\cal{F}}_5$$ and $${\\cal{F}}_7$$. Adv. Math. Commun. 1, 223\u2013238 (2007).","journal-title":"Adv. Math. Commun."},{"key":"921_CR15","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1016\/j.ffa.2011.12.006","volume":"18","author":"S Han","year":"2012","unstructured":"Han S., Kim J.L., Lee H., Lee Y.: Construction of quasi-cyclic self-dual codes. Finite Fields Appl. 18, 613\u2013633 (2012).","journal-title":"Finite Fields Appl."},{"issue":"6","key":"921_CR16","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1109\/TIT.1985.1057109","volume":"31","author":"JM Jensen","year":"1985","unstructured":"Jensen J.M.: The concatenated structure of cyclic and abelian codes. IEEE Trans. Inf. Theory 31(6), 788\u2013793 (1985).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"921_CR17","doi-asserted-by":"crossref","unstructured":"Jitman S., Palines H.S., dela Cruz R.B.: On Quasi-Abelian complementary dual codes. In: Barbero \u00c1., Skachek V., Ytrehus \u00d8. (eds.) Coding Theory and Applications, ICMCTA, vol. 10495. Lecture Notes in Computer Science. Springer, Cham (2017).","DOI":"10.1007\/978-3-319-66278-7_16"},{"key":"921_CR18","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":"921_CR19","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":"921_CR20","doi-asserted-by":"publisher","first-page":"1052","DOI":"10.1109\/TIT.2003.809501","volume":"49","author":"S Ling","year":"2003","unstructured":"Ling S., Sol\u00e9 P.: Good self-dual quasi-cyclic codes exist. IEEE Trans. Inf. Theory 49, 1052\u20131053 (2003).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"921_CR21","unstructured":"MacWilliams F.J., Sloane N.J.A.: The theory of error-correcting codes, I, vol. 16. North-Holland Publishing Co., North-Holland Mathematical Library, Amsterdam-New York-Oxford (1977)."},{"key":"921_CR22","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. Discret. Math. 106\u2013107, 337\u2013342 (1992).","journal-title":"Discret. Math."},{"key":"921_CR23","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 dual meet the Gilbert-Varshamov bound. Discret. Math. 285, 345\u2013347 (2004).","journal-title":"Discret. Math."},{"key":"921_CR24","unstructured":"Shi M., Wu M.R., Sol\u00e9 P.: Long cyclic codes are good. arXiv:1709.09865v3."},{"key":"921_CR25","first-page":"201","volume":"35","author":"SK Wasan","year":"1977","unstructured":"Wasan S.K.: Quasi abelian codes. Publ. Inst. Math. 35, 201\u2013206 (1977).","journal-title":"Publ. Inst. Math."},{"key":"921_CR26","first-page":"130","volume":"13","author":"EJ Weldon","year":"1970","unstructured":"Weldon E.J.: Long quasi-cyclic codes are good. IEEE Trans. Inf. Theory 13, 130 (1970).","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-021-00921-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-021-00921-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-021-00921-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,27]],"date-time":"2022-10-27T16:19:56Z","timestamp":1666887596000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-021-00921-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,15]]},"references-count":26,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["921"],"URL":"https:\/\/doi.org\/10.1007\/s10623-021-00921-4","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,15]]},"assertion":[{"value":"7 December 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 July 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 August 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 September 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}