{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T16:11:59Z","timestamp":1758125519670},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T00:00:00Z","timestamp":1186704000000},"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":[[2007,9,21]]},"DOI":"10.1007\/s10623-007-9113-2","type":"journal-article","created":{"date-parts":[[2007,8,9]],"date-time":"2007-08-09T15:27:09Z","timestamp":1186673229000},"page":"213-217","source":"Crossref","is-referenced-by-count":2,"title":["A search algorithm for linear codes: progressive dimension growth"],"prefix":"10.1007","volume":"45","author":[{"given":"Tsvetan","family":"Asamov","sequence":"first","affiliation":[]},{"given":"Nuh","family":"Aydin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,8,10]]},"reference":[{"issue":"3","key":"9113_CR1","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1023\/A:1011283523000","volume":"24","author":"N Aydin","year":"2001","unstructured":"Aydin N, Siap I and Ray-Chaudhuri DK (2001). The structure of 1-generator quasi-twisted codes and new linear codes. Des Codes Cryptogr 24(3): 313\u2013326","journal-title":"Des Codes Cryptogr"},{"key":"9113_CR2","volume-title":"Discovering mathematics with magma: reducing the abstract to concrete","year":"2006","unstructured":"(2006). Discovering mathematics with magma: reducing the abstract to concrete. Springer, Berlin"},{"key":"9113_CR3","unstructured":"Brouwer AE. Bounds (Bounds on the minimum distance of linear codes). http:\/\/www.win.tue.nl\/aeb\/voorlincod.html"},{"issue":"1","key":"9113_CR4","doi-asserted-by":"crossref","first-page":"1193","DOI":"10.1109\/TIT.2006.890727","volume":"53","author":"EZ Chen","year":"2007","unstructured":"Chen EZ (2007). New quasi-cyclic codes from simpex codes. IEEE Trans Inform Theory 53(1): 1193","journal-title":"IEEE Trans Inform Theory"},{"issue":"5","key":"9113_CR5","doi-asserted-by":"crossref","first-page":"1687","DOI":"10.1109\/18.771246","volume":"45","author":"R Daskalov","year":"1999","unstructured":"Daskalov R, Gulliver TA and Metodieva E (1999). New ternary linear codes. IEEE Trans Inform Theory 45(5): 1687\u20131688","journal-title":"IEEE Trans Inform Theory"},{"issue":"9","key":"9113_CR6","doi-asserted-by":"crossref","first-page":"2259","DOI":"10.1109\/TIT.2003.815798","volume":"49","author":"R Daskalov","year":"2003","unstructured":"Daskalov R and Hristov P (2003). New quasi-twisted degenerate ternary linear codes. IEEE Trans Inform Theory 49(9): 2259\u20132263","journal-title":"IEEE Trans Inform Theory"},{"key":"9113_CR7","unstructured":"Grassl M. Bounds on the minimum distance of linear codes. http:\/\/www.codetables.de"},{"key":"9113_CR8","doi-asserted-by":"crossref","unstructured":"Grassl M, White G (2005) New codes from chains of quasi-cyclic codes. In: Proceedings of IEEE international symposium on information theory (ISIT 2005), Adelaide, Australia, September 2005, pp 2095\u20132099","DOI":"10.1109\/ISIT.2005.1523715"},{"key":"9113_CR9","first-page":"105","volume":"56","author":"TA Gulliver","year":"2000","unstructured":"Gulliver TA and \u00d6stergard PRJ (2000). New binary linear codes. Ars Combinatoria 56: 105\u2013112","journal-title":"Ars Combinatoria"},{"key":"9113_CR10","volume-title":"The theory of error correcting codes","author":"FJ MacWilliams","year":"1977","unstructured":"MacWilliams FJ and Sloane NJA (1977). The theory of error correcting codes. North Holland, Amsterdam"},{"key":"9113_CR11","unstructured":"MAGMA computer algebra system. http:\/\/magma.maths.usyd.edu.au\/magma\/MagmaInfo.html"},{"issue":"4","key":"9113_CR12","doi-asserted-by":"crossref","first-page":"1554","DOI":"10.1109\/18.850694","volume":"46","author":"I Siap","year":"2000","unstructured":"Siap I, Aydin N and Ray-Chaudhuri DK (2000). New ternary quasi-cyclic codes with better minimum distances. IEEE Trans Inform Theory 46(4): 1554\u20131558","journal-title":"IEEE Trans Inform Theory"},{"key":"9113_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-011-3810-9","volume-title":"Algebraic geometry codes","author":"MA Tsfasman","year":"1991","unstructured":"Tsfasman MA and Vl\u01cedut SG (1991). Algebraic geometry codes. Kluwert, Dordrecht"},{"issue":"6","key":"9113_CR14","doi-asserted-by":"crossref","first-page":"1757","DOI":"10.1109\/18.641542","volume":"43","author":"A Vardy","year":"1997","unstructured":"Vardy A (1997). The intractability of computing the minimum distance of a code. IEEE Trans Inform Theory 43(6): 1757\u20131766","journal-title":"IEEE Trans Inform Theory"},{"key":"9113_CR15","unstructured":"White G (preprint) An improved minimum weight algorithm for quasi-cyclic and quasi-twisted codes"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-007-9113-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-007-9113-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-007-9113-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:50:08Z","timestamp":1559245808000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-007-9113-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,8,10]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,9,21]]}},"alternative-id":["9113"],"URL":"https:\/\/doi.org\/10.1007\/s10623-007-9113-2","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,8,10]]}}}