{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T20:49:38Z","timestamp":1772138978828,"version":"3.50.1"},"reference-count":12,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3942,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Mathematics Letters"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s0893-9659(02)00050-2","type":"journal-article","created":{"date-parts":[[2002,10,21]],"date-time":"2002-10-21T14:05:17Z","timestamp":1035209117000},"page":"833-836","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":24,"title":["New quasi-cyclic codes over 5"],"prefix":"10.1016","volume":"15","author":[{"given":"N.","family":"Aydin","sequence":"first","affiliation":[]},{"given":"I.","family":"Siap","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0893-9659(02)00050-2_BIB1","first-page":"295","article-title":"Bounds on the size of linear codes","author":"Brouwer","year":"1998"},{"key":"10.1016\/S0893-9659(02)00050-2_BIB2","unstructured":"A.E. Brouwer, Bounds on the minimum distance of linear codes (server), Eindhoven University of Technology, The Netherlands, http:\/\/www.win.tue.nl\/math\/dw\/personalpages\/aeb\/voorlincod.html."},{"key":"10.1016\/S0893-9659(02)00050-2_BIB3","unstructured":"K. Lally and P. Fitzpatrick, Algebraic structure of quasi-cyclic codes, Disc. Appl. Math. (to appear)."},{"key":"10.1016\/S0893-9659(02)00050-2_BIB4","unstructured":"N. Aydin, I. Siap and D.K. Ray-Chaudhuri, The structure of 1-generator quasi-twisted codes and new linear codes, Des. Codes Cryptogr. (to appear)."},{"issue":"11","key":"10.1016\/S0893-9659(02)00050-2_BIB5","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF00124211","article-title":"Optimal ternary quasi-cyclic codes","volume":"2","author":"Greenough","year":"1992","journal-title":"Des. Codes Cryptogr."},{"key":"10.1016\/S0893-9659(02)00050-2_BIB6","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1109\/TIT.1974.1055262","article-title":"A Gilbert-Varshamov bound for quasi-cyclic codes of rate 1\/2","volume":"20","author":"Kasami","year":"1974","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"10.1016\/S0893-9659(02)00050-2_BIB7","doi-asserted-by":"crossref","first-page":"1666","DOI":"10.1109\/18.333888","article-title":"Six new binary quasi-cyclic codes","volume":"40","author":"Zhi","year":"1994","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"10.1016\/S0893-9659(02)00050-2_BIB8","doi-asserted-by":"crossref","first-page":"1647","DOI":"10.1109\/18.623167","article-title":"New good quasi-cyclic ternary and quaternary linear codes","volume":"43","author":"Daskalov","year":"1997","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"10.1016\/S0893-9659(02)00050-2_BIB9","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1007\/s002000050117","article-title":"Bounds on minimum distance for linear codes over GF(5)","volume":"9","author":"Daskalov","year":"1999","journal-title":"Appl. Algebra Engrg. Comm. Comput."},{"issue":"5","key":"10.1016\/S0893-9659(02)00050-2_BIB10","doi-asserted-by":"crossref","first-page":"1687","DOI":"10.1109\/18.771246","article-title":"New ternary linear codes","volume":"45","author":"Daskalov","year":"1999","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"10.1016\/S0893-9659(02)00050-2_BIB11","first-page":"51","article-title":"Polynomial approach to quasi-cyclic codes","volume":"69","author":"Thomas","year":"1977","journal-title":"Bul. Calcutta Math. Soc."},{"issue":"4","key":"10.1016\/S0893-9659(02)00050-2_BIB12","doi-asserted-by":"crossref","first-page":"1554","DOI":"10.1109\/18.850694","article-title":"New ternary quasi-cyclic codes with better minimum distances","volume":"46","author":"Siap","year":"2000","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Applied Mathematics Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893965902000502?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893965902000502?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T03:05:37Z","timestamp":1760238337000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0893965902000502"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":12,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0893965902000502"],"URL":"https:\/\/doi.org\/10.1016\/s0893-9659(02)00050-2","relation":{},"ISSN":["0893-9659"],"issn-type":[{"value":"0893-9659","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"New quasi-cyclic codes over 5","name":"articletitle","label":"Article Title"},{"value":"Applied Mathematics Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0893-9659(02)00050-2","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}]}}