{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T18:03:07Z","timestamp":1767981787905,"version":"3.49.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,2,26]],"date-time":"2020-02-26T00:00:00Z","timestamp":1582675200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,26]],"date-time":"2020-02-26T00:00:00Z","timestamp":1582675200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1007\/s40314-020-1120-1","type":"journal-article","created":{"date-parts":[[2020,2,26]],"date-time":"2020-02-26T09:03:02Z","timestamp":1582707782000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Quasi-cyclic codes: algebraic properties and applications"],"prefix":"10.1007","volume":"39","author":[{"given":"Mohamadbagher","family":"Zeraatpisheh","sequence":"first","affiliation":[]},{"given":"Morteza","family":"Esmaeili","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9919-0323","authenticated-orcid":false,"given":"T. Aaron","family":"Gulliver","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,2,26]]},"reference":[{"issue":"5","key":"1120_CR1","doi-asserted-by":"publisher","first-page":"1062","DOI":"10.1016\/j.disc.2011.11.021","volume":"312","author":"N Aboluion","year":"2012","unstructured":"Aboluion N, Smith DH, Perkins S (2012) Linear and nonlinear constructions of DNA codes with Hamming distance $$d$$, constant GC-content and a reverse-complement constraint. Discrete Math 312(5):1062\u20131075","journal-title":"Discrete Math"},{"key":"1120_CR2","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1016\/j.jfranklin.2006.02.009","volume":"343","author":"T Abualrub","year":"2006","unstructured":"Abualrub T, Ghrayeb A, Zeng XN (2006) Construction of cyclic codes over GF(4) for DNA computing. J Frankl Inst 343:448\u2013457","journal-title":"J Frankl Inst"},{"key":"1120_CR3","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1126\/science.7973651","volume":"266","author":"L Adleman","year":"1994","unstructured":"Adleman L (1994) Molecular computation of solutions to combinatorial problems. Science 266:1021\u20131024","journal-title":"Science"},{"key":"1120_CR4","doi-asserted-by":"crossref","unstructured":"Bringer J, Carlet C, Chabanne H, Guilley S, Maghrebi H (2014) Orthogonal direct sum masking A smartcard friendly computation paradigm in a code, with builtin protection against side-channel and fault attacks. In: Proceedings of the int. workshop on information security theory and practice, lecture notes in computer science, vol 8501, pp 40\u201356","DOI":"10.1007\/978-3-662-43826-8_4"},{"issue":"3","key":"1120_CR5","doi-asserted-by":"publisher","first-page":"1694","DOI":"10.1109\/TIT.2018.2873130","volume":"65","author":"C Carlet","year":"2019","unstructured":"Carlet C, Mesnager S, Tang C, Qi Y (2019) On $$\\sigma $$-LCD codes. IEEE Trans Inf Theory 65(3):1694\u20131704","journal-title":"IEEE Trans Inf Theory"},{"key":"1120_CR6","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 (2009) On complementary dual quasi-cyclic codes. Finite Fields Appl 15:375\u2013386","journal-title":"Finite Fields Appl"},{"issue":"1","key":"1120_CR7","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1109\/18.651076","volume":"44","author":"M Esmaeili","year":"1998","unstructured":"Esmaeili M, Gulliver TA, Secord NP, Mahmoud SA (1998) A link between quasi-cyclic codes and convolutional codes. IEEE Trans Inf Theory 44(1):431\u2013435","journal-title":"IEEE Trans Inf Theory"},{"key":"1120_CR8","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.tcs.2004.11.004","volume":"334","author":"P Gaborit","year":"2005","unstructured":"Gaborit P, King OD (2005) Linear constructions for DNA codes. Theor Comput Sci 334:99\u2013113","journal-title":"Theor Comput Sci"},{"key":"1120_CR9","unstructured":"Grassl M (2020) Bounds on the minimum distance of linear codes and quantum codes. http:\/\/www.codetables.de"},{"issue":"6","key":"1120_CR10","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/s00200-013-0188-x","volume":"24","author":"K Guenda","year":"2013","unstructured":"Guenda K, Gulliver TA (2013) Construction of cyclic codes over $${\\mathbb{F}}_2 + u{\\mathbb{F}}_2$$ for DNA computing. Appl Algebra Eng Commun Comput 24(6):445\u2013459","journal-title":"Appl Algebra Eng Commun Comput"},{"issue":"2","key":"1120_CR11","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 (2013) The concatenated structure of quasi-cyclic codes and an improvement of Jensen\u2019s bound. IEEE Trans Inf Theory 59(2):979\u2013985","journal-title":"IEEE Trans Inf Theory"},{"key":"1120_CR12","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 (2016) Quasi-cyclic complementary dual codes. Finite Fields Appl 42:67\u201380","journal-title":"Finite Fields Appl"},{"key":"1120_CR13","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.ffa.2017.06.005","volume":"47","author":"C G\u00fcneri","year":"2017","unstructured":"G\u00fcneri C, \u00d6zbudak F, \u00d6zkaya B, Sa\u00e7\u0131kara E, Sepasdar Z, Sol\u00e9 P (2017) Structure and performance of generalized quasi-cyclic codes. Finite Fields Appl 47:183\u2013202","journal-title":"Finite Fields Appl"},{"key":"1120_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/s12095-019-0354-5","author":"C G\u00fcneri","year":"2019","unstructured":"G\u00fcneri C, \u00d6zbudak F, Sa\u00e7\u0131kara E (2019) A concatenated construction of linear complementary pair of codes. Crypt Commun. https:\/\/doi.org\/10.1007\/s12095-019-0354-5","journal-title":"Crypt Commun"},{"key":"1120_CR15","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/j.ffa.2015.10.008","volume":"37","author":"H Hong","year":"2016","unstructured":"Hong H, Wang L, Ahmad H, Li J, Yang Y, Wu C (2016) Construction of DNA codes by using algebraic number theory. Finite Fields Appl 37:328\u2013343","journal-title":"Finite Fields Appl"},{"issue":"8","key":"1120_CR16","doi-asserted-by":"publisher","first-page":"5484","DOI":"10.1109\/TIT.2011.2177066","volume":"58","author":"L Jin","year":"2012","unstructured":"Jin L, Xing C (2012) Euclidean and Hermitian self-orthogonal algebraic geometry codes and their application to quantum codes. IEEE Trans Inf Theory 58(8):5484\u20138489","journal-title":"IEEE Trans Inf Theory"},{"issue":"1\u20132","key":"1120_CR17","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/S0166-218X(00)00350-4","volume":"111","author":"K Lally","year":"2001","unstructured":"Lally K, Fitzpatrick P (2001) Algebraic structure of quasi-cyclic codes. Discrete Appl Math 111(1\u20132):157\u2013175","journal-title":"Discrete Appl Math"},{"issue":"3","key":"1120_CR18","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1021\/la0112209","volume":"18","author":"M Li","year":"2002","unstructured":"Li M, Lee HJ, Condon AE, Corn RM (2002) DNA word design strategy for creating sets of non-interacting oligonucleotides for DNA microarrays. Langmuir 18(3):805\u2013812","journal-title":"Langmuir"},{"issue":"7","key":"1120_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 (2001) On the algebraic structure of quasi-cyclic codes. I: finite fields. IEEE Trans Inf Theory 47(7):2751\u20132760","journal-title":"IEEE Trans Inf Theory"},{"key":"1120_CR20","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/j.ffa.2017.10.001","volume":"49","author":"X Liu","year":"2018","unstructured":"Liu X, Fan Y, Liu H (2018) Galois LCD codes over finite fields. Finite Fields Appl 49:227\u2013242","journal-title":"Finite Fields Appl"},{"key":"1120_CR21","unstructured":"Maple, Waterloo Maple Inc. (2020) Waterloo, ON"},{"issue":"3","key":"1120_CR22","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1089\/10665270152530818","volume":"8","author":"A Marathe","year":"2001","unstructured":"Marathe A, Condon AE, Corn RM (2001) On combinatorial DNA word design. J Comput Biol 8(3):201\u2013220","journal-title":"J Comput Biol"},{"issue":"3","key":"1120_CR23","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/S0019-9958(64)90438-3","volume":"7","author":"JL Massey","year":"1964","unstructured":"Massey JL (1964) Reversible codes. Inf Control 7(3):369\u2013380","journal-title":"Inf Control"},{"key":"1120_CR24","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 JL (1992) Linear codes with complementary duals. Discrete Math 106\u2013107:337\u2013342","journal-title":"Discrete Math"},{"key":"1120_CR25","unstructured":"S\u00e9guin GE, Drolet G (1990) The theory of 1-generator quasi-cyclic codes, Tech. Rep., Dept. of Elec. Comp. Eng., Royal Military College, Kingston"},{"issue":"8","key":"1120_CR26","doi-asserted-by":"publisher","first-page":"1745","DOI":"10.1109\/TIT.2004.831861","volume":"50","author":"GE S\u00e9guin","year":"2004","unstructured":"S\u00e9guin GE (2004) A class of 1-generator quasicyclic codes. IEEE Trans Inf Theory 50(8):1745\u20131753","journal-title":"IEEE Trans Inf Theory"},{"key":"1120_CR27","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.ffa.2016.01.010","volume":"39","author":"M Shi","year":"2016","unstructured":"Shi M, Zhang Y (2016) Quasi-twisted codes with constacyclic constituent codes. Finite Fields Appl 39:159\u2013178","journal-title":"Finite Fields Appl"},{"key":"1120_CR28","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1016\/j.jfranklin.2009.07.002","volume":"346","author":"I Siap","year":"2009","unstructured":"Siap I, Abualrub T, Ghrayeb A (2009) Cyclic DNA codes over the ring $$\\frac{{\\mathbb{F}}_2[u]}{(u^2 - 1)}$$ based on the deletion distance. J Frankl Inst 346:731\u2013740","journal-title":"J Frankl Inst"},{"key":"1120_CR29","first-page":"51","volume":"69","author":"K Thomas","year":"1977","unstructured":"Thomas K (1977) Polynomial approach to quasi-cyclic codes. Bull Calcutta Math Soc 69:51\u201359","journal-title":"Bull Calcutta Math Soc"},{"issue":"1\u20133","key":"1120_CR30","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 JL (1994) The condition for a cyclic code to have a complementary dual. Discrete Math 126(1\u20133):391\u2013393","journal-title":"Discrete Math"},{"issue":"9","key":"1120_CR31","doi-asserted-by":"publisher","first-page":"6283","DOI":"10.1109\/TIT.2018.2792488","volume":"64","author":"S Yazdi","year":"2018","unstructured":"Yazdi S, Kiah HM, Gabrys R, Milenkovic O (2018) Mutually uncorrelated primers for DNA-based data storage. IEEE Trans Inf Theory 64(9):6283\u20136296","journal-title":"IEEE Trans Inf Theory"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-020-1120-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s40314-020-1120-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-020-1120-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,25]],"date-time":"2021-02-25T00:59:09Z","timestamp":1614214749000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s40314-020-1120-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,26]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["1120"],"URL":"https:\/\/doi.org\/10.1007\/s40314-020-1120-1","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,26]]},"assertion":[{"value":"15 June 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 January 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 February 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 February 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"96"}}