{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T18:20:25Z","timestamp":1773253225252,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T00:00:00Z","timestamp":1549238400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1007\/s10623-019-00613-0","type":"journal-article","created":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T15:27:05Z","timestamp":1549294025000},"page":"2199-2212","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["On equivalence of cyclic codes, generalization of a quasi-twisted search algorithm, and new linear codes"],"prefix":"10.1007","volume":"87","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5618-2427","authenticated-orcid":false,"given":"Nuh","family":"Aydin","sequence":"first","affiliation":[]},{"given":"Jonathan","family":"Lambrinos","sequence":"additional","affiliation":[]},{"given":"Oliver","family":"VandenBerg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,4]]},"reference":[{"issue":"4","key":"613_CR1","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1016\/j.aml.2010.11.003","volume":"24","author":"R Ackerman","year":"2011","unstructured":"Ackerman R., Aydin N.: New quinary linear codes from quasi-twisted codes and their duals. Appl. Math. Lett. 24(4), 512\u2013515 (2011).","journal-title":"Appl. Math. Lett."},{"issue":"3","key":"613_CR2","doi-asserted-by":"publisher","first-page":"1691","DOI":"10.1016\/j.jfranklin.2013.11.019","volume":"351","author":"N Aydin","year":"2014","unstructured":"Aydin N., Murphree J.: New linear codes from constacyclic codes. J. Frankl. Inst. 351(3), 1691\u20131699 (2014).","journal-title":"J. Frankl. Inst."},{"issue":"7","key":"613_CR3","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1016\/S0893-9659(02)00050-2","volume":"15","author":"N Aydin","year":"2002","unstructured":"Aydin N., Siap I.: New quasi-cyclic codes over $${\\mathbb{F}}_5$$ F 5 . Appl. Math. Lett. 15(7), 833\u2013836 (2002).","journal-title":"Appl. Math. Lett."},{"issue":"3","key":"613_CR4","doi-asserted-by":"publisher","first-page":"313326","DOI":"10.1023\/A:1011283523000","volume":"24","author":"N Aydin","year":"2001","unstructured":"Aydin N., Siap I., Ray-Chaudhuri D.K.: The structure of 1-generator quasi-twisted codes and new linear codes. Des. Codes Cryptogr. 24(3), 313326 (2001).","journal-title":"Des. Codes Cryptogr."},{"key":"613_CR5","unstructured":"Aydin N,. Asamov T., Gulliver, T.A.: Some open problems on quasi-twisted and related code constructions and good quaternary codes. In: Proceeding of International Symposium on Information Theory Nice, France, pp. 856\u2013860 (2007)."},{"issue":"4","key":"613_CR6","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s00200-017-0327-x","volume":"28","author":"N Aydin","year":"2017","unstructured":"Aydin N., Connolly N., Murphree J.: New binary linear codes from quasi-cyclic codes and an augmentation algorithm. Appl. Algebra Eng. Commun. Comput. 28(4), 339\u2013350 (2017).","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"1","key":"613_CR7","doi-asserted-by":"publisher","first-page":"245","DOI":"10.3934\/amc.2017016","volume":"11","author":"N Aydin","year":"2017","unstructured":"Aydin N., Connolly N., Grassl M.: Some results on the structure of constacyclic codes and new linear codes over GF(7) from quasi-twisted codes. Adv. Math. Commun. 11(1), 245\u2013258 (2017).","journal-title":"Adv. Math. Commun."},{"key":"613_CR8","unstructured":"Babai L., Codenotti P., Groshow, J.A., Qiao, Y.: Code equivalence and group isomorphism. In: Proceeding of ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, 13951408 (2011)."},{"key":"613_CR9","volume-title":"Algebraic Coding Theory","author":"ER Berlekamp","year":"1968","unstructured":"Berlekamp E.R.: Algebraic Coding Theory. McGraw-Hill, New York (1968)."},{"issue":"5","key":"613_CR10","doi-asserted-by":"publisher","first-page":"1666","DOI":"10.1109\/18.333888","volume":"40","author":"Z Chen","year":"1994","unstructured":"Chen Z.: Six new binary quasi-cyclic codes. IEEE Trans. Inf. Theory 40(5), 1666\u20131667 (1994).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"613_CR11","doi-asserted-by":"publisher","first-page":"2642","DOI":"10.1109\/18.887874","volume":"46","author":"R Daskalov","year":"2000","unstructured":"Daskalov R., Gulliver T.A.: New quasi-twisted quaternary linear codes. IEEE Trans. Inf. Theory 46(7), 2642\u20132643 (2000).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"613_CR12","doi-asserted-by":"publisher","first-page":"3001","DOI":"10.1109\/TIT.2003.819337","volume":"49","author":"R Daskalov","year":"2003","unstructured":"Daskalov R., Hristov P.: New binary one-generator quasi-cyclic codes. IEEE Trans. Inf. Theory 49(11), 3001\u20133005 (2003).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"613_CR13","doi-asserted-by":"publisher","first-page":"2259","DOI":"10.1109\/TIT.2003.815798","volume":"49","author":"R Daskalov","year":"2003","unstructured":"Daskalov R., Hristov P.: New quasi-twisted degenerate ternary linear codes. IEEE Trans. Inf. Theory 49(9), 2259\u20132263 (2003).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"613_CR14","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0012-365X(03)00126-2","volume":"275","author":"R Daskalov","year":"2004","unstructured":"Daskalov R., Hristov P., Metodieva E.: New minimum distance bounds for linear codes over $$GF(5)$$ G F ( 5 ) . Discret. Math. 275(1), 97\u2013110 (2004).","journal-title":"Discret. Math."},{"issue":"2","key":"613_CR15","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s10623-014-9945-5","volume":"76","author":"E Dobson","year":"2015","unstructured":"Dobson E.: Monomial isomorphisms of cyclic codes. Des. Codes Cryptogr. 76(2), 257\u2013267 (2015).","journal-title":"Des. Codes Cryptogr."},{"key":"613_CR16","unstructured":"Grassl M.: Code tables: bounds on the parameters of codes. http:\/\/www.codetables.de\/ ."},{"issue":"3","key":"613_CR17","doi-asserted-by":"crossref","first-page":"261","DOI":"10.13069\/jacodesmath.327375","volume":"4","author":"K Guenda","year":"2017","unstructured":"Guenda K., Gulliver T.A.: On the equivalence of cyclic and quasi-cyclic codes over finite fields. J. Algebra Comb. Discret. Struct. Appl. 4(3), 261\u2013269 (2017).","journal-title":"J. Algebra Comb. Discret. Struct. Appl."},{"issue":"3","key":"613_CR18","first-page":"223","volume":"7","author":"TA Gulliver","year":"1996","unstructured":"Gulliver T.A., Bhargava V.K.: New good rate $$(m1)\/pm$$ ( m 1 ) \/ p m ternary and quaternary quasi-cyclic codes. Des. Codes Cryptogr. 7(3), 223\u2013233 (1996).","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"613_CR19","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0012-365X(94)00343-H","volume":"154","author":"WC Huffman","year":"1996","unstructured":"Huffman W.C.: The equivalence of two cyclic objects on $$pq$$ pq elements. Discret. Math. 154(1), 103\u2013127 (1996).","journal-title":"Discret. Math."},{"key":"613_CR20","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":"2","key":"613_CR21","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0097-3165(93)90043-8","volume":"62","author":"WC Huffman","year":"1993","unstructured":"Huffman W.C., Job V., Pless V.: Multipliers and generalized multipliers of cyclic objects and cyclic codes. J. Comb. Theory A 62(2), 183\u2013215 (1993).","journal-title":"J. Comb. Theory A"},{"issue":"5","key":"613_CR22","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1109\/TIT.1984.1056944","volume":"30","author":"JS Leon","year":"1984","unstructured":"Leon J.S., Masley J.M., Pless V.: Duadic codes. IEEE Trans. Inf. Theory 30(5), 709\u2013714 (1984).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"613_CR23","unstructured":"Magma computer algebra system. http:\/\/magma.maths.usyd.edu.au\/ ."},{"key":"613_CR24","first-page":"114","volume":"42\u201344","author":"RJ McEliece","year":"1978","unstructured":"McEliece R.J.: A public-key cryptosystem based on algebraic coding theory. DSN Prog. Rep. 42\u201344, 114\u2013116 (1978).","journal-title":"DSN Prog. Rep."},{"key":"613_CR25","unstructured":"Muzychuk M.: A solution of an equivalence problem for semisimple cyclic codes. arXiv:1105.4320v1 (2011)."},{"issue":"5","key":"613_CR26","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1109\/TIT.1986.1057213","volume":"32","author":"DW Newhart","year":"1986","unstructured":"Newhart D.W.: Inequivalent cyclic codes of prime length. IEEE Trans. Inf. Theory 32(5), 703\u2013705 (1986).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"613_CR27","doi-asserted-by":"publisher","first-page":"1602","DOI":"10.1109\/18.623157","volume":"43","author":"E Petrank","year":"1997","unstructured":"Petrank E., Roth R.M.: Is code equivalence easy to decide? IEEE Trans. Inf. Theory 43(5), 1602\u20131604 (1997).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"613_CR28","volume-title":"Cyclic Error-Correcting Codes in Two Symbols. Technical Report TN-57-103","author":"E Prange","year":"1957","unstructured":"Prange E.: Cyclic Error-Correcting Codes in Two Symbols. Technical Report TN-57-103. Air Force Cambridge Research Center, Cambridge (1957)."},{"key":"613_CR29","volume-title":"Some Cyclic Error-Correcting Codes with Simple Decoding Algorithm. Technical Report TN-58-156","author":"E Prange","year":"1958","unstructured":"Prange E.: Some Cyclic Error-Correcting Codes with Simple Decoding Algorithm. Technical Report TN-58-156. Air Force Cambridge Research Center, Cambridge (1958)."},{"issue":"4","key":"613_CR30","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1109\/18.850662","volume":"46","author":"N Sendrier","year":"2000","unstructured":"Sendrier N.: Finding the permutation between equivalent linear codes: the support splitting algorithm. IEEE Trans. Inf. Theory 46(4), 1193\u20131203 (2000).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"613_CR31","unstructured":"Sendrier N., Simos D.E.: How easy is code equivalence over $$\\mathbb{F}_q$$ F q ? In: Proceeding of International Workshop on Coding Theory and Crypt, Bergen, Norway (2013)."},{"key":"613_CR32","series-title":"Springer Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-642-38616-9_14","volume-title":"Post-quantum Cryptography","author":"N Sendrier","year":"2013","unstructured":"Sendrier N., Simos D.E.: The hardness of code equivalence over $$\\mathbb{F}_q$$ F q and its application to code-based cryptography. In: Gaborit P. (ed.) Post-quantum Cryptography, vol. 7932, pp. 203\u2013216. Springer Lecture Notes in Computer ScienceSpringer, Limoges (2013)."},{"issue":"4","key":"613_CR33","doi-asserted-by":"publisher","first-page":"1554","DOI":"10.1109\/18.850694","volume":"46","author":"I Siap","year":"2000","unstructured":"Siap I., Aydin N., Ray-Chaudhuri D.K.: New ternary quasi-cyclic codes with improved minimum distances. IEEE Trans. Inf. Theory 46(4), 1554\u20131558 (2000).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"613_CR34","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1109\/18.641542","volume":"43","author":"A Vardy","year":"1997","unstructured":"Vardy A.: The intractability of computing the minimum distance of a code. IEEE Trans. Inf. Theory 43(6), 1757\u20131766 (1997).","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-019-00613-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-019-00613-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-019-00613-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,14]],"date-time":"2024-07-14T14:44:02Z","timestamp":1720968242000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-019-00613-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,4]]},"references-count":34,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["613"],"URL":"https:\/\/doi.org\/10.1007\/s10623-019-00613-0","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2,4]]},"assertion":[{"value":"6 August 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 January 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 January 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 February 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}