{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:22:37Z","timestamp":1740122557685,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,10,10]],"date-time":"2022-10-10T00:00:00Z","timestamp":1665360000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,10]],"date-time":"2022-10-10T00:00:00Z","timestamp":1665360000000},"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":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s10623-022-01124-1","type":"journal-article","created":{"date-parts":[[2022,10,10]],"date-time":"2022-10-10T14:03:59Z","timestamp":1665410639000},"page":"763-777","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A generalization of cyclic code equivalence algorithm to constacyclic codes"],"prefix":"10.1007","volume":"91","author":[{"given":"Dev","family":"Akre","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5618-2427","authenticated-orcid":false,"given":"Nuh","family":"Aydin","sequence":"additional","affiliation":[]},{"given":"Matthew","family":"Harrington","sequence":"additional","affiliation":[]},{"given":"Saurav","family":"Pandey","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,10]]},"reference":[{"key":"1124_CR1","unstructured":"Aydin N., Guidotti T., Liu P.: Good classical and quantum codes from multi-twisted codes. CoRR arXiv:2008.07037 (2020)"},{"key":"1124_CR2","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.ffa.2016.12.002","volume":"45","author":"N Aydin","year":"2017","unstructured":"Aydin N., Halilovi\u0107 A.: A generalization of quasi-twisted codes: multi-twisted codes. Finite Fields Appl. 45, 96\u2013106 (2017). https:\/\/doi.org\/10.1016\/j.ffa.2016.12.002.","journal-title":"Finite Fields Appl."},{"key":"1124_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/s00200-021-00525-4","author":"NO Aydin","year":"2021","unstructured":"Aydin N.O., Vandenberg R.O.: A new algorithm for equivalence of cyclic codes and its applications. Appl. Algebra Eng. Commun. Comput. (2021). https:\/\/doi.org\/10.1007\/s00200-021-00525-4.","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"3","key":"1124_CR4","doi-asserted-by":"publisher","first-page":"313","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), 313\u2013326 (2001). https:\/\/doi.org\/10.1023\/a:1011283523000.","journal-title":"Des. Codes Cryptogr."},{"issue":"4","key":"1124_CR5","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). https:\/\/doi.org\/10.1007\/s00200-017-0327-x.","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"1","key":"1124_CR6","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). https:\/\/doi.org\/10.3934\/amc.2017016.","journal-title":"Adv. Math. Commun."},{"issue":"10","key":"1124_CR7","doi-asserted-by":"publisher","first-page":"2199","DOI":"10.1007\/s10623-019-00613-0","volume":"87","author":"N Aydin","year":"2019","unstructured":"Aydin N., Lambrinos J., Vandenberg O.: On equivalence of cyclic codes, generalization of a quasi-twisted search algorithm, and new linear codes. Des. Codes Cryptogr. 87(10), 2199\u20132212 (2019). https:\/\/doi.org\/10.1007\/s10623-019-00613-0.","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"1124_CR8","doi-asserted-by":"publisher","first-page":"137","DOI":"10.2140\/involve.2020.13.137","volume":"13","author":"N Aydin","year":"2020","unstructured":"Aydin N., Guidotti T.H., Liu P., Shaikh A.S., Vandenberg R.O.: Some generalizations of the ASR search algorithm for quasitwisted codes. Involve J. Math. 13(1), 137\u2013148 (2020). https:\/\/doi.org\/10.2140\/involve.2020.13.137.","journal-title":"Involve J. Math."},{"issue":"3","key":"1124_CR9","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1103\/physrevlett.78.405","volume":"78","author":"AR Calderbank","year":"1997","unstructured":"Calderbank A.R., Rains E.M., Shor P.W., Sloane N.J.A.: Quantum error correction and orthogonal geometry. Phys. Rev. Let. 78(3), 405\u2013408 (1997). https:\/\/doi.org\/10.1103\/physrevlett.78.405.","journal-title":"Phys. Rev. Let."},{"key":"1124_CR10","unstructured":"Chen E.: Quasi-cyclic codes: bounds on the parameters of of QC codes. http:\/\/www.tec.hkr.se\/~chen\/research\/codes\/qc.htm. Accessed Aug 2021"},{"issue":"11","key":"1124_CR11","doi-asserted-by":"publisher","first-page":"5835","DOI":"10.1109\/tit.2015.2473861","volume":"61","author":"K Ding","year":"2015","unstructured":"Ding K., Ding C.: A class of two-weight and three-weight codes and their applications in secret sharing. IEEE Trans. Inf. Theory 61(11), 5835\u20135842 (2015). https:\/\/doi.org\/10.1109\/tit.2015.2473861.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"1124_CR12","doi-asserted-by":"publisher","first-page":"2150003","DOI":"10.1142\/s0219498821500031","volume":"19","author":"HQ Dinh","year":"2019","unstructured":"Dinh H.Q., Bag T., Upadhyay A.K., Ashraf M., Mohammad G., Chinnakum W.: Quantum codes from a class of constacyclic codes over finite commutative rings. J. Algebra Appl. 19(12), 2150003 (2019). https:\/\/doi.org\/10.1142\/s0219498821500031.","journal-title":"J. Algebra Appl."},{"issue":"3","key":"1124_CR13","doi-asserted-by":"publisher","first-page":"1862","DOI":"10.1103\/physreva.54.1862","volume":"54","author":"D Gottesman","year":"1996","unstructured":"Gottesman D.: Class of quantum error-correcting codes saturating the quantum hamming bound. Phys. Rev. A 54(3), 1862\u20131868 (1996). https:\/\/doi.org\/10.1103\/physreva.54.1862.","journal-title":"Phys. Rev. A"},{"key":"1124_CR14","unstructured":"Grassl M.: Code tables: bounds on the parameters of codes. http:\/\/www.codetables.de\/. Accessed Aug 2021"},{"key":"1124_CR15","unstructured":"Group M.: Magma computer algebra system. http:\/\/magma.maths.usyd.edu.au\/calc\/. Accessed Aug 2021"},{"key":"1124_CR16","doi-asserted-by":"publisher","DOI":"10.13069\/jacodesmath.645015","author":"TA Gulliver","year":"2019","unstructured":"Gulliver T.A., Venkaiah V.C.: Construction of quasi-twisted codes and enumeration of defining polynomials. J. Algebra Comb. Discret. Struct. Appl. (2019). https:\/\/doi.org\/10.13069\/jacodesmath.645015.","journal-title":"J. Algebra Comb. Discret. Struct. Appl."},{"key":"1124_CR17","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) https:\/\/doi.org\/10.1017\/cbo9780511807077."},{"issue":"10","key":"1124_CR18","doi-asserted-by":"publisher","first-page":"2917","DOI":"10.2298\/fil1710917k","volume":"31","author":"M Koroglu","year":"2017","unstructured":"Koroglu M., Siap I.: A class of constacyclic codes from group algebras. Filomat 31(10), 2917\u20132923 (2017). https:\/\/doi.org\/10.2298\/fil1710917k.","journal-title":"Filomat"},{"key":"1124_CR19","unstructured":"Lu L., Li R., Fu Q., Xuan C., Ma W.: Optimal ternary linear complementary dual codes. CoRR arXiv:2012.12093 (2020)"},{"issue":"3","key":"1124_CR20","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/s0019-9958(64)90438-3","volume":"7","author":"JL Massey","year":"1964","unstructured":"Massey J.L.: Reversible codes. Inf. Control 7(3), 369\u2013380 (1964). https:\/\/doi.org\/10.1016\/s0019-9958(64)90438-3.","journal-title":"Inf. Control"},{"key":"1124_CR21","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). https:\/\/doi.org\/10.1016\/0012-365x(92)90563-u.","journal-title":"Discret. Math."},{"issue":"5","key":"1124_CR22","doi-asserted-by":"publisher","first-page":"1602","DOI":"10.1109\/18.623157","volume":"43","author":"E Petrank","year":"1997","unstructured":"Petrank E., Roth R.: Is code equivalence easy to decide? IEEE Trans. Inf. Theory 43(5), 1602\u20131604 (1997). https:\/\/doi.org\/10.1109\/18.623157.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"1124_CR23","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1103\/physrevlett.77.793","volume":"77","author":"AM Steane","year":"1996","unstructured":"Steane A.M.: Error correcting codes in quantum theory. Phys. Rev. Let. 77(5), 793\u2013797 (1996). https:\/\/doi.org\/10.1103\/physrevlett.77.793.","journal-title":"Phys. Rev. Let."},{"issue":"6","key":"1124_CR24","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). https:\/\/doi.org\/10.1109\/18.641542.","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-022-01124-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01124-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01124-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,10]],"date-time":"2023-03-10T18:17:46Z","timestamp":1678472266000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01124-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,10]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["1124"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01124-1","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2022,10,10]]},"assertion":[{"value":"27 February 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 June 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 September 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 October 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}