{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T20:49:40Z","timestamp":1772138980329,"version":"3.50.1"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,5,17]],"date-time":"2017-05-17T00:00:00Z","timestamp":1494979200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1007\/s00200-017-0327-x","type":"journal-article","created":{"date-parts":[[2017,5,17]],"date-time":"2017-05-17T08:27:10Z","timestamp":1495009630000},"page":"339-350","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["New binary linear codes from quasi-cyclic codes and an augmentation algorithm"],"prefix":"10.1007","volume":"28","author":[{"given":"Nuh","family":"Aydin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicholas","family":"Connolly","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Murphree","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,17]]},"reference":[{"key":"327_CR1","unstructured":"Grassl, M.: Code tables: bounds on the parameters of codes. \n                        http:\/\/www.codetables.de\/"},{"key":"327_CR2","doi-asserted-by":"crossref","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, 1757\u20131766 (1997)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"327_CR3","doi-asserted-by":"crossref","first-page":"1666","DOI":"10.1109\/18.333888","volume":"40","author":"EZ Chen","year":"1994","unstructured":"Chen, E.Z.: Six new binary quasi-cyclic codes. IEEE Trans. Inf. Theory 40(5), 1666\u20131667 (1994)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"327_CR4","first-page":"223","volume":"7","author":"TA Gulliver","year":"1996","unstructured":"Gulliver, T.A., Bhargava, V.K.: New good rate \n                        $$(m-1)$$\n                        \n                            \n                                            \n                                \n                                    (\n                                    m\n                                    -\n                                    1\n                                    )\n                                \n                            \n                        \n                    \/pm ternary and quaternary quasi-cyclic codes. Des. Codes Cryptogr. 7(3), 223\u2013233 (1996)","journal-title":"Des. Codes Cryptogr."},{"issue":"4","key":"327_CR5","doi-asserted-by":"crossref","first-page":"1554","DOI":"10.1109\/18.850694","volume":"46","author":"I Siap","year":"2000","unstructured":"Siap, I., Aydin, N., Ray-Chaudhuri, D.: 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":"3","key":"327_CR6","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1023\/A:1011283523000","volume":"23","author":"N Aydin","year":"2001","unstructured":"Aydin, N., Siap, I., Ray-Chaudhuri, D.: The structure of 1-generator quasi-twisted codes and new linear codes. Des. Codes Cryptogr. 23(3), 313\u2013326 (2001)","journal-title":"Des. Codes Cryptogr."},{"key":"327_CR7","doi-asserted-by":"crossref","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 \n                        $$\\mathbb{F}_5$$\n                        \n                            \n                                            \n                                \n                                    F\n                                    5\n                                \n                            \n                        \n                    . Appl. Math. Lett. 15, 833\u2013836 (2002)","journal-title":"Appl. Math. Lett."},{"issue":"9","key":"327_CR8","doi-asserted-by":"crossref","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":"11","key":"327_CR9","doi-asserted-by":"crossref","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"},{"key":"327_CR10","doi-asserted-by":"crossref","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). Discrete Math. 275, 97\u2013110 (2004)","journal-title":"Discrete Math."},{"issue":"4","key":"327_CR11","doi-asserted-by":"crossref","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":"Math. Lett."},{"key":"327_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-015-0059-5","author":"EZ Chen","year":"2015","unstructured":"Chen, E.Z.: New binary h-generator quasi-cyclic codes by augmentation and new minimum distance bounds. Des. Codes Cryptogr. (2015). doi:\n                        10.1007\/s10623-015-0059-5","journal-title":"Des. Codes Cryptogr."},{"issue":"3","key":"327_CR13","doi-asserted-by":"crossref","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."}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00200-017-0327-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-017-0327-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-017-0327-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,7,25]],"date-time":"2017-07-25T10:23:06Z","timestamp":1500978186000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00200-017-0327-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,17]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["327"],"URL":"https:\/\/doi.org\/10.1007\/s00200-017-0327-x","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,5,17]]}}}