{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,21]],"date-time":"2023-06-21T19:06:49Z","timestamp":1687374409545},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,3,16]],"date-time":"2014-03-16T00:00:00Z","timestamp":1394928000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2015,8]]},"DOI":"10.1007\/s10623-014-9950-8","type":"journal-article","created":{"date-parts":[[2014,3,17]],"date-time":"2014-03-17T21:30:02Z","timestamp":1395091802000},"page":"307-323","source":"Crossref","is-referenced-by-count":2,"title":["A new iterative computer search algorithm for good quasi-twisted codes"],"prefix":"10.1007","volume":"76","author":[{"given":"Eric Zhi","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,3,16]]},"reference":[{"key":"9950_CR1","doi-asserted-by":"crossref","unstructured":"Aydin N., Siap I.: New quasi-cyclic codes over F $$_{5}$$ 5 . Appl. Math. Lett. 15, 833\u2013836 (2002).","DOI":"10.1016\/S0893-9659(02)00050-2"},{"key":"9950_CR2","doi-asserted-by":"crossref","unstructured":"Aydin N., Siap I., Ray-Chaudhuri K.: The structure of 1-generator quasi-twisted codes and new linear codes. Des. Codes Cryptogr. 24, 313\u2013326 (2001).","DOI":"10.1023\/A:1011283523000"},{"key":"9950_CR3","unstructured":"Berlekamp E.R.: Algebraic Coding Theory. Aegean Park Press, Laguna Hills (1984)."},{"key":"9950_CR4","doi-asserted-by":"crossref","unstructured":"Bhargava V.K., Seguin G.E., Stein J.M.: Some (mk, k) cyclic codes in quasi-cyclic form. IEEE Trans. Inf. Theory 24, 358\u2013369 (1978).","DOI":"10.1109\/TIT.1978.1055930"},{"key":"9950_CR5","doi-asserted-by":"crossref","unstructured":"Bosma W., Cannon J., Playoust C.: The Magma algebra system. I. The user language. J. Symb. Comput. 24, 235\u2013265 (1997).","DOI":"10.1006\/jsco.1996.0125"},{"key":"9950_CR6","doi-asserted-by":"crossref","unstructured":"Calderbank A.R., Kantor W.M.: The geometry of two-weight codes. Bull. Lond. Math. Soc. 18, 97\u2013122 (1986).","DOI":"10.1112\/blms\/18.2.97"},{"key":"9950_CR7","doi-asserted-by":"crossref","unstructured":"Chen E.Z.: Six new binary quasi-cyclic codes. IEEE Trans. Inf. Theory 40, 1666\u20131667 (1994).","DOI":"10.1109\/18.333888"},{"key":"9950_CR8","unstructured":"Chen E.Z.: Quasi-cyclic codes derived from cyclic codes. In: Proceedings of the International Symposium on Information Theory and its Applications (ISITA2004), Parma, pp. 162\u2013165 (2004)."},{"key":"9950_CR9","doi-asserted-by":"crossref","unstructured":"Chen E.Z.: New quasi-cyclic codes from simplex codes. IEEE Trans. Inf. Theory 53, 1193\u20131196 (2007).","DOI":"10.1109\/TIT.2006.890727"},{"key":"9950_CR10","unstructured":"Chen E.Z.: Web Database of Binary QC Codes. http:\/\/moodle.tec.hkr.se\/~chen\/research\/codes\/searchqc2.htm . Accessed 11 Mar 2014."},{"key":"9950_CR11","doi-asserted-by":"crossref","unstructured":"Chen C.L., Peterson W.W.: Some results on quasi-cyclic codes. Inf. Control 15, 407\u2013423 (1969).","DOI":"10.1016\/S0019-9958(69)90497-5"},{"key":"9950_CR12","doi-asserted-by":"crossref","unstructured":"Daskalov R., Hristov P.: New quasi-twisted degenerate ternary linear codes. IEEE Trans. Inf. Theory 49, 2259\u20132263 (2003).","DOI":"10.1109\/TIT.2003.815798"},{"key":"9950_CR13","doi-asserted-by":"crossref","unstructured":"Daskalov R.N., Gulliver T.A., Metodieva E.: New good quasi-cyclic ternary and quaternary linear codes. IEEE Trans. Inf. Theory 43, 1647\u20131650 (1997).","DOI":"10.1109\/18.623167"},{"key":"9950_CR14","doi-asserted-by":"crossref","unstructured":"Daskalov R.N., Gulliver T.A., Metodieva E.: New ternary linear codes. IEEE Trans. Inf. Theory 45, 1687\u20131688 (1999).","DOI":"10.1109\/18.771246"},{"key":"9950_CR15","doi-asserted-by":"crossref","unstructured":"Daskalov R., Hristov P., Metodieva E.: New minimum distance bounds for linear codes over GF(5). Discret. Math. 275, 97\u2013110 (2004).","DOI":"10.1016\/S0012-365X(03)00126-2"},{"key":"9950_CR16","unstructured":"Grassl M.: Tables of linear codes and quantum codes. http:\/\/codetables.de . Accessed 11 Mar 2014."},{"key":"9950_CR17","doi-asserted-by":"crossref","unstructured":"Greenough P.P., Hill R.: Optimal ternary quasi-cyclic codes. Des. Codes Cryptogr. 2, 81\u201391 (1992).","DOI":"10.1007\/BF00124211"},{"key":"9950_CR18","doi-asserted-by":"crossref","unstructured":"Gulliver T.A.: New optimal ternary linear codes. IEEE Trans. Inf. Theory 41, 1182\u20131185 (1995).","DOI":"10.1109\/18.391267"},{"key":"9950_CR19","doi-asserted-by":"crossref","unstructured":"Gulliver T.A., Bhargava V.K.: Some best rate 1\/p and rate (p $$-$$ - 1)\/p systematic quasi-cyclic codes. IEEE Trans. Inf. Theory 37, 552\u2013555 (1991).","DOI":"10.1109\/18.79911"},{"key":"9950_CR20","doi-asserted-by":"crossref","unstructured":"Gulliver T.A., Bhargava V.K.: Nine good (m $$-$$ - 1)\/pm quasi-cyclic codes. IEEE Trans. Inf. Theory 38, 1366\u20131369 (1992).","DOI":"10.1109\/18.144718"},{"key":"9950_CR21","doi-asserted-by":"crossref","unstructured":"Gulliver T.A., Bhargava V.K.: some best rate 1\/p and rate (p $$-$$ - 1)\/p systematic quasi-cyclic codes over GF(3) and GF(4). IEEE Trans. Inf. Theory 38, 1369\u20131374 (1992).","DOI":"10.1109\/18.144719"},{"key":"9950_CR22","doi-asserted-by":"crossref","unstructured":"Gulliver T.A., Bhargava V.K.: New good rate (m $$-$$ - 1)\/pm ternary and quaternary quasi-cyclic codes. Des. Codes Cryptogr. 7, 223\u2013233 (1996).","DOI":"10.1007\/BF00124513"},{"key":"9950_CR23","doi-asserted-by":"crossref","unstructured":"Gulliver T.A., \u00d6sterg\u00e5rd J.: Improved bounds for ternary linear codes of dimension 7. IEEE Trans. Inf. Theory 43, 1377\u20131388 (1997).","DOI":"10.1109\/18.605613"},{"key":"9950_CR24","doi-asserted-by":"crossref","unstructured":"Gulliver T.A., \u00d6sterg\u00e5rd P.R.J.: Improved bounds for quaternary linear codes of dimension 6. Appl. Algebra Eng. Commun. Comput. 9, 153\u2013159 (1998).","DOI":"10.1007\/s002000050100"},{"key":"9950_CR25","unstructured":"Gulliver T.A., \u00d6sterg\u00e5rd P.R.J.: New binary linear codes. Ars Comb. 56, 105\u2013112 (2000)."},{"key":"9950_CR26","doi-asserted-by":"crossref","unstructured":"Gulliver T.A., \u00d6sterg\u00e5rd P.R.J.: Improved bounds for ternary linear codes of dimension 8 using tabu search. J. Heuristics 7, 37\u201346 (2000).","DOI":"10.1023\/A:1026513628412"},{"key":"9950_CR27","doi-asserted-by":"crossref","unstructured":"Heijnen P., vanTiborg H.C.A., Verhoeff T., Weijs S.: Some new binary quasi-cyclic codes. IEEE Trans. Inf. Theory 44, 1994\u20131996 (1998).","DOI":"10.1109\/18.705580"},{"key":"9950_CR28","doi-asserted-by":"crossref","unstructured":"Kasami T.: A gilbert-varshamov bound for quasi-cyclic codes of rate 1\/2. IEEE Trans. Inf. Theory 20, 679 (1974).","DOI":"10.1109\/TIT.1974.1055262"},{"key":"9950_CR29","unstructured":"Maruta T., et. al.: New linear codes from cyclic or generalized cyclic codes by puncturing. In: Proceedings of the 10th International Workshop on Algebraic and Combinatorial Coding Theory (ACCT-10), Zvenigorod, pp. 194\u2013197 (2006)."},{"key":"9950_CR30","doi-asserted-by":"crossref","unstructured":"Siap I., Aydin N., Ray-Chaudhuri D.K.: New ternary quasi-cyclic codes with better minimum distances. IEEE Trans. Inf. Theory 46, 1554\u20131558 (2000).","DOI":"10.1109\/18.850694"},{"key":"9950_CR31","doi-asserted-by":"crossref","unstructured":"Townsend R.L., Weldon E.: Self-orthogonal quasi-cyclic codes. IEEE Trans. Inf. Theory 13, 183\u2013195 (1967).","DOI":"10.1109\/TIT.1967.1053974"},{"key":"9950_CR32","doi-asserted-by":"crossref","unstructured":"Van Tilborg H.C.A.: On quasi-cyclic codes with rate 1\/m. IEEE Trans. Inf. Theory 24, 628\u2013629 (1978).","DOI":"10.1109\/TIT.1978.1055929"},{"key":"9950_CR33","doi-asserted-by":"crossref","unstructured":"Vardy A.: The intractability of computing the minimum distance of a code. IEEE Trans. Inf. Theory 43, 1757\u20131766 (1997).","DOI":"10.1109\/18.641542"},{"key":"9950_CR34","doi-asserted-by":"crossref","unstructured":"Venkaiah V.C., Gulliver T.A.: Quasi-cyclic codes over F $$_{13}$$ 13 and enumeration of defining polynomials. J. Discret. Algorithms 16, 249\u2013257 (2012).","DOI":"10.1016\/j.jda.2012.04.006"},{"key":"9950_CR35","unstructured":"Weldon E.J. Jr.: Long quasi-cyclic codes are good. IEEE Trans. Inf. Theory 16, 130 (1970)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-014-9950-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-014-9950-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-014-9950-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:58:38Z","timestamp":1559231918000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-014-9950-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,16]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,8]]}},"alternative-id":["9950"],"URL":"https:\/\/doi.org\/10.1007\/s10623-014-9950-8","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3,16]]}}}